Abstract
The "coefficient H technique" is a tool introduced in 1991 and used to prove various pseudo-random properties from the distribution of the number of keys that sends cleartext on some ciphertext. It can also be used to find attacks on cryptographic designs. We can like this unify a lot of various pseudo-random results obtained by different authors. In this paper we will present this technique and we will give some examples of results obtained. © 2009 Springer.
Cite
CITATION STYLE
Patarin, J. (2008). The “coefficients H” technique. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5381 LNCS, pp. 328–345). https://doi.org/10.1007/978-3-642-04159-4_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
