Generic attacks on unbalanced Feistel schemes with contracting functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4284 LNCS, Issue , 2006, Pages 396-411

  Patarin, Jacques ^a   Nachef, Valérie ^b   Berbain, Côme ^c  

^a LABORATOIRE DES SCIENCES DU CLIMAT ET DE L ENVIRONNEMENT   (France)

^b UNIVERSITÉ DE CERGY PONTOISE   (France)

^c ORANGE LABS   (France)

Author keywords

Block ciphers; Generic attacks; Luby Rackoff theory; Pseudo random permutations; Unbalanced Feistel permutations

Indexed keywords

BLOCK CIPHERS; CHOSEN-PLAINTEXT ATTACK; FEISTEL SCHEME; KNOWN-PLAINTEXT ATTACKS; LUBY-RACKOFF THEORY; PSEUDO-RANDOM FUNCTIONS; PSEUDORANDOM PERMUTATION;

BLOCK CODES; LYAPUNOV METHODS; NETWORK SECURITY;

CRYPTOGRAPHY;

EID: 77649244626     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11935230_26     Document Type: Conference Paper

References (15)

1. William Aiello and Ramarathnam Venkatesan. Foiling Birthday Attacks in Length-Doubling Transformations - Benes: A Non-Reversible Alternative to Feistel. In Ueli M. Maurer, editor, Advances in Cryptology - EUROCRYPT '96, volume 1070 of Lecture Notes in Computer Science, pages 307-320. Springer-Verlag, 1996.
2. Don Coppersmith. Luby-Rackoff: Four rounds is not enough. Technical Report RC20674, IBM Research Report, december 1996.
3. Shimon Even and Oded Goldreich. Des-like functions can generate the alternating group. IEEE Transactions on Information Theory, 29(6):863-865, 1983.
4. Charanjit S. Jutla. Generalized Birthday Arracks on Unbalanced Feistel Networks. In Hugo Krawczyk, editor, Advances in Cryptology - CRYPTO '98, volume 1462 of Lecture Notes in Computer Science, pages 186-199. Springer-Verlag, 1998.
5. Lars R. Knudsen. DEAL - A 128-bit Block Cipher. Technical Report 151, University of Bergen, Department of Informatics, Norway, february 1998.
6. Lars R. Knudsen and Vincent Rijmen. On the Decorrelated Fast Cipher (DFC) and Its Theory. In Lars R. Knudsen, editor, Fast Software Encrytion - FSE '99, volume 1636 of Lecture Notes in Computer Science, pages 81-94. Springer-Verlag, 1999.
7. Michael Luby and Charles Rackoff. How to Construct Pseudorandom Permutations from Pseudorandom Functions. SIAM J. Comput., 17(2):373-386, 1988.
8. Stefan Lucks. Faster Luby-Rackoff Ciphers. In Dieter Gollman, editor, Fast Software Encryption - FSE '96, volume 1039 of Lecture Notes in Computer Science, pages 189-203. Springer-Verlag, 1996.
9. Moni Naor and Omer Reingold. On the Construction of Pseudorandom Permutations: Luby-Rackoff Revisited. J. Cryptology, 12(1):29-66, 1999.
10. Jacques Patarin. New Results on Pseudorandom Permutation Generators Based on the DES Scheme. In Joan Feigenbaum, editor, Advances in Cryptology - CRYPTO '91, volume 576 of Lecture Notes in Computer Science, pages 301-312. Springer-Verlag, 1991.
11. Jacques Patarin. Generic Attacks on Feistel Schemes. In Colin Boyd, editor, Advances in Cryptology - ASIACRYPT 2001, volume 2248 of Lecture Notes in Computer Science, pages 222-238. Springer-Verlag, 2001.
12. Jacques Patarin. Security of Random Feistel Schemes with 5 or More Rounds. In Matthew K. Franklin, editor, Advances in Cryptology - CRYPTO 2004, volume 3152 of Lecture Notes in Computer Science, pages 106-122. Springer-Verlag, 2004.
13. Jacques Patarin, Valérie Nachef, and Côme Berbain. Generic Attacks on Unbalanced Feistel Schemes with Contracting Functions, Extended Version. available from the authors, 2006.
14. Jacques Patarin, Valérie Nachef, and Côme Berbain. Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions. available from the authors, 2006.
15. Bruce Schneier and John Kelsey. Unbalanced Feistel Networks and Block Cipher Design. In Dieter Gollmann, editor, Fast Software Encrytion - FSE '96, volume 1039 of Lecture Notes in Computer Science, pages 121-144. Springer-Verlag, 1996.