Luby-Rackoff: 7 rounds are enough for 2n(1-ε) security

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

Volumn 2729, Issue , 2003, Pages 513-529

  Patarin, Jacques ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

CHOSEN CIPHERTEXT ATTACK; CHOSEN-PLAINTEXT ATTACK; COMPUTING POWER; FEISTEL CIPHERS; FEISTEL SCHEME; KNOWN-PLAINTEXT ATTACKS; OPTIMAL VALUES; RANDOM PERMUTATIONS;

CRYPTOGRAPHY;

EID: 35248853456     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45146-4_30     Document Type: Article

References (20)

1. William Aiollo, Ramarathnam Venkatesan, Foiling Birthday Attacks in Length-Doubling Transformations - Benes: A Non-Reversible Alternative to Feistel. Eurocrypt 96, LNCS 1070, Springer, pp. 307-320.
2. John Black, Philip Rogaway, Ciphers with Arbitrary Finite Domains, [RS]A'2002, pp. 114-130, Springer LNCS 2271, February 2002.
3. M. Luby, C. Rackoff, How to construct pseudorandom permutations from pseudorandom functions, SIAM Journal on Computing, vol. 17, n. 2, pp. 373-386, April 1988.
4. U. Maurer, A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators, Eurocrypt'92, Springer, pp. 239-255.
5. U. Maurer: Indistinguishability of Random Systems, Eurocrypt 2002, LNCS 2332, Springer, pp. 110-132.
6. U. Maurer, K. Pietrzak: The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations, Eurocrypt 2003, May 2003, Warsaw, Poland, LNCS, Springer.
7. Moni Naor and Omer Reingold, On the construction of pseudo-random permutations: Luby-Rackoff revisited, Journal of Cryptology, vol 12, 1999, pp. 29-66.
8. 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, Springer, pp. 193-204.
10. J. Patarin, New results on pseudorandom permutation generators based on the DES scheme, Crypto'91, Springer, pp. 301-312.
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, How to construct pseudorandom and super pseudorandom permutations from one single pseudorandom function. Eurocrypt'92, Springer, pp. 256-266.
13. J. Patarin, Improved Security Bounds for Pseudorandom Permutations, 4th ACM Conference on Computer and Communications Security April 2-4th 1997, Zurich, Switzerland, pp. 142-150.
14. J. Patarin, About Feistel Schemes with Six (or More) Rounds, in Fast Software Encryption 1998, pp. 103-121.
15. J. Patarin, Generic Attacks on Feistel Schemes, Asiacrypt 2001, LNCS 2248, Springer, pp. 222-238.
16. n(1-ε) Security. Extended version of this paper. Available from the author.
17. S. Patel, Z. Ramzan and G. Sundaram, Toward making Luby-Rackoff ciphers optimal and practical, FSE'99, LNCS, Springer, 1999.
18. J. Pieprzyk, How to construct pseudorandom permutations from Single Pseudorandom Functions, Eurocrypt'90, LNCS 473, Springer, pp. 140-150.
19. Z. Ramzan, L. Reyzin, On the Round Security of Symmetric-Key Cryptographic Primitives, Crypto 2000, LNCS 1880, Springer, pp. 376-393.
20. B. Schneier and J. Kelsey, Unbalanced Feistel Networks and Block Cipher Design, FSE'96, LNCS 1039, Springer, pp. 121-144.