Unbalanced Feistel schemes with expanding functions are used to construct pseudo-random permutations from kn bits to kn bits by using random functions from n bits to (k - 1)n bits. At each round, all the bits except n bits are changed by using a function that depends only on these n bits. Jutla [6] investigated such schemes, which he denotes by Fkd, where d is the number of rounds. In this paper, we describe novel Known Plaintext Attacks (KPA) and Non-Adaptive Chosen Plaintext Attacks (CPA-1) against these schemes. With these attacks we will often be able to improve the results of Jutla. © International Association for Cryptology Research 2007.
CITATION STYLE
Patarin, J., Nachef, V., & Berbain, C. (2007). Generic attacks on unbalanced feistel schemes with expanding functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4833 LNCS, pp. 325–341). Springer Verlag. https://doi.org/10.1007/978-3-540-76900-2_20
Mendeley helps you to discover research relevant for your work.