Luby-Rackoff ciphers: Why XOR is not so exclusive

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

Volumn 2595, Issue , 2003, Pages 271-290

  Patel, Sarvar ^a   Ramzan, Zulfikar ^b   Sundaram, Ganpathy S ^a  

^a LUCENT TECHNOLOGIES   (United States)

^b IP Dynamics

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; GROUP THEORY; HASH FUNCTIONS;

ABELIAN GROUP; BINARY OPERATIONS; CHARACTERISTIC 2; CIPHER TEXT ATTACKS; EXCLUSIVE-OR; FEISTEL NETWORKS; FINITE GROUPS; TIME/SPACE COMPLEXITY;

CRYPTOGRAPHY;

EID: 21144452515     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36492-7_18     Document Type: Article

References (18)

1. M. Bellare, J. Kilian, and P. Rogaway. The security of cipher block chaining. In Yvo G. Desmedt, editor, Advances in Cryptology - CRYPTO '94, volume 839 of Lecture Notes in Computer Science, pages 341-358. Springer-Verlag, 21-25 August 1994.
2. E. R. Berlekamp. Factoring polynomials over large finite fields. Mathematics of Computation, 24:713-735, 1970.
3. E. Biham and A. Shamir. Differential Cryptanalysis of the Data Encryption Standard. Springer Verlag, 1993. ISBN: 0-387-97930-1, 3-540-97930.
4. G. Carter, E. Dawson, and L. Nielsen. DESV: A Latin Square variation of DES. In Proceeding of Workshop on Selected Areas of Cryptography, 1995.
5. M. Etzel, S. Patel, and Z. Ramzan. Square hash: Fast message authentication via optimized universal hash functions. In Proc. CRYPTO 99, Lecture Notes in Computer Science. Springer-Verlag, 1999.
6. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
7. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33(4):792-807, October 1986.
8. I. N. Herstein. Topics in Algebra. Blaisdell Publishing Company, 1964.
9. R. Karp. Reducibility among combinatorial problems. in Complexity of Computer Computations, 1972.
10. M. Luby and C. Rackoff. How to construct pseudorandom permutations and pseudorandom functions. SIAM J. Computing, 17(2):373-386, April 1988.
11. M. Naor and O. Reingold. On the construction of pseudo-random permutations: Luby-Rackoff revisited. J. of Cryptology, 12:29-66, 1999.
12. Preliminary version in: Proc. STOC 97.
13. J. Patarin. New results on pseudorandom permutation generators based on the DES scheme. In Proc. CRYPTO 91, Lecture Notes in Computer Science. Springer-Verlag, 1991.
14. J. Patarin. Improved security bounds for pseudorandom permutations. In 4th ACM Conference on Computer and Communications Security, pages 140-150, 1997.
15. S. Patel, Z. Ramzan, and G. Sundaram. Towards making Luby-Rackoff ciphers optimal and practical. In Proc. Fast Software Encryption 99, Lecture Notes in Computer Science. Springer-Verlag, 1999.
16. R. A. Rueppel. On the security of Schnorr's pseudo random generator. In Proc. EUROCRYPT 89, Lecture Notes in Computer Science. Springer-Verlag, 1989.
17. D. R. Stinson. Comments on definitions of universal hash families, August 2000. Available from: http://cacr.math.uwaterloo.ca/∼dstinson/.
18. Y. Zheng, T. Matsumoto, and H. Imai. Impossibility and optimality results on constructing pseudorandom permutations. In Proc. EUROCRYPT 89, Lecture Notes in Computer Science. Springer-Verlag, 1989.