Security of Random Feistel Schemes with 5 or More Rounds

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

Volumn 3152, Issue , 2004, Pages 106-122

  Patarin, Jacques ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

MOBILE SECURITY; SECURITY OF DATA;

CHOSEN CIPHERTEXT ATTACK; CHOSEN-PLAINTEXT ATTACK; FEISTEL SCHEME; KNOWN-PLAINTEXT ATTACKS; PLAINTEXT;

CRYPTOGRAPHY;

EID: 35048880937     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28628-8_7     Document Type: Article

References (16)

1. W. Aiello and R. Venkatesan. Foiling Birthday Attacks in Length-Doubling Transformations-Benes: A Non-Reversible Alternative to Feistel. EUROCRYPT '96 (Lecture Notes in Computer Science 1070), pp. 307-320, Springer-Verlag.
2. L. R. Knudsen. DEAL - A 128 bit Block Cipher. Technical Report #151, University of Bergen, Departement of Informatics, Norway, February 1998.
3. M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal on Computing, vol. 17, no 2, pp. 373-386, April 1988.
4. U. Maurer. A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators. EUROCRYPT '92, pp. 239-255, Springer-Verlag.
5. U. Maurer. Indistinguishability of Random Systems. EUROCRYPT '02 (Lecture Notes in Computer Science 2332), pp. 110-132, Springer-Verlag.
6. U. Maurer and K. Pietrzak. The security of Many-Round Luby-Rackoff Pseudo-Random Permutations. EUROCRYPT '03, pp. -, Springer-Verlag.
7. V. Nachev. Random Feistel schemes for m = 3, available from the author at: Valerie.nachef@math.u-cergy.fr.
8. M. Naor and O. Reingold. On the Construction of pseudo-random perlutations: Luby-Rackoff revisited. Journal of Cryptology, vol. 12, 1999, pp. 29-66. Extended abstract was published in Proc. 29th Ann. ACM Symp. on Theory of Computing, 1997, pp. 189-199.
9. J. Patarin. Pseudorandom Permutations based on the DES Scheme. Eurocode '90, LNCS 514, pp. 193-204, Springer-Verlag.
10. J. Patarin. New results on pseudorandom permutation generators based on the DES scheme. Crypto '91,pp. 301-312, Springer-Verlag.
11. J. Patarin. Etude des générateurs de permutations basés sur le schéma du DES. Ph. D. Thesis, Inria, Domaine de Voluceau, Le Chesnay, France, 1991.
12. J. Patarin. About Feistel Schemes with 6 (or More) Rounds. Fast Software Encryption 1998, pp. 103-121.
13. J. Patarin. Generic Attacks on Feistel Schemes. Asiacrypt '01 (Lecture Notes in Computer Science 2248), pp. 222-238, Springer-Verlag.
14. n(1-ε) Security. Crypto '03 (Lecture Notes in Computer Science 2729), pp.513-529, Springer-Verlag.
15. J. Patarin. Extended version of this paper, avaible from the author.
16. B. Schneier and J. Kelsey. Unbalanced Feistel Networks and Block Cipher Design. FSE '96 (Lecture Notes in Computer Science 1039), pp. 121-144, Springer-Verlag.