The security of feistel ciphers with six rounds or less

Journal of Cryptology

Volumn 15, Issue 3, 2003, Pages 207-222

  Knudsen, Lars R ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

Cryptanalysis; Data Encryption Standard; Feistel ciphers; Luby Rackoff permutations

Indexed keywords

COMPUTER CRIME; COMPUTER NETWORKS; CRYPTOGRAPHY; DATA PRIVACY; MATHEMATICAL MODELS; RANDOM PROCESSES;

CRYPTANALYSIS; DATA ENCRYPTION STANDARD; FEISTEL CIPHERS; LUBY-RACKOFF PERMUTATIONS;

SECURITY OF DATA;

EID: 0041750485     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/s00145-002-9839-y     Document Type: Article

References (31)

1. W. Aiello and R. Venkatesan. Foiling birthday attacks in length-doubling transformations. In U. Maurer, editor, Advances in Cryptology - EUROCRYPT '96, LNCS 1070, pages 307-320. Springer-Verlag, Berlin, 1996.
2. E. Biham. Cryptanalysis of Ladder-DES. In E. Biham, editor, Fast Software Encryption, Fourth International Workshop, Haifa, Israel, January 1997, LNCS 1267, pages 134-138. Springer-Verlag, Berlin, 1997.
3. E. Biham, A. Biryukov, and A. Shamir. Cryptanalysis of Skipjack reduced to 31 rounds using impossible differentials. In J. Stern, editor, Advances in Cryptology: EUROCRYPT '99, LNCS 1592, pages 12-23. Springer-Verlag, Berlin, 1999.
4. E. Biham and A. Shamir. Differential Cryptanalysis of DES-like cryptosystems. Journal of Cryptology, 4(1):3-72, 1991.
5. E. Biham and A. Shamir. Differential Cryptanalysis of the Data Encryption Standard. Springer-Verlag, New York, 1993.
6. A. Biryukov and D. Wagner. Slide attacks. In L.R. Knudsen, editor, Fast Software Encryption, Sixth International Workshop, Rome, Italy, March 1999, LNCS 1636, pages 245-259. Springer-Verlag, Berlin, 1999.
7. D. Coppersmith. Luby-Rackoff: four rounds is not enough. Technical Report RC 20674, IBM, December 1996.
8. D. Coppersmith, D.B. Johnson, and S.M. Matyas. A proposed mode for triple-DES encryption. IBM Journal of Research and Development, 40(2):253-261, March 1996.
9. Electronic Frontier Foundation. Cracking DES - Secrets of Encryption Research, Wiretap Politics & Chip Design. O'Reilly, Cambridge, MA, 1998. ISBN 1-56592-520-3.
10. W. Feller. Probability Theory and its Applications, Vol. I. Wiley, New York, 1950.
11. H. Feistel, W.A. Notz, and J.L. Smith. Some cryptographic techniques for machine-to-machine data communications. Proceedings of IEEE, 63(11):1545-1554, 1975.
12. L.R. Knudsen. Block Ciphers - Analysis, Design and Applications. Ph.D. thesis, Aarhus University, 1994.
13. L.R. Knudsen. Truncated and higher order differentials. In B. Preneel, editor, Fast Software Encryption-Second International Workshop, Leuven, Belgium, LNCS 1008, pages 196-211. Springer-Verlag, Berlin, 1995.
14. L.R. Knudsen. DEAL - a 128-bit block cipher. Technical Report 151, Department of Informatics, University of Bergen, February 1998. Submitted as an AES candidate by Richard Outerbridge.
15. X. Lai, J.L. Massey, and S. Murphy. Markov ciphers and differential cryptanalysis. In D.W. Davies, editor, Advances in Cryptology - EUROCRYPT '91, LNCS 547, pages 17-38. Springer-Verlag, Berlin, 1992.
16. M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal of Computing, 17(2):373-386, 1988.
17. S. Lucks. On the security of the 128-bit block cipher DEAL. In L.R. Knudsen, editor, Fast Software Encryption, Sixth International Workshop, Rome, Italy, March 1999, LNCS 1636, pages 60-70. Springer-Verlag, Berlin, 1999.
18. M. Matsui. The first experimental cryptanalysis of the Data Encryption Standard. In Y.G. Desmedt, editor, Advances in Cryptology - CRYPTO '94, LNCS 839, pages 1-11. Springer-Verlag, Berlin, 1994.
19. M. Matsui. New structure of block ciphers with provable security against differential and linear crypt-analysis. In D. Gollman, editor, Fast Software Encryption, Third International Workshop, Cambridge, UK, February 1996, LNCS 1039, pages 205-218. Springer-Verlag, Berlin, 1996.
20. M. Matsui. New block encryption algorithm MISTY. In E. Biham, editor, Fast Software Encryption, Fourth International Workshop, Haifa, Israel, January 1997, LNCS 1267, pages 54-68. Springer-Verlag, Berlin, 1997.
21. M. Naor and O. Reingold. On the construction of pseudorandom permutations: Luby-Rackoff revisited. Journal of Cryplology, 12(1):29-66, 1999.
22. National Bureau of Standards. Data Encryption Standard. Federal Information Processing Standard (FIPS), Publication 46, National Bureau of Standards, U.S. Department of Commerce, Washington, DC, January 1977.
23. National Institute of Standards and Technology. Advanced encryption algorithm (AES) development effort, http://www.nist.gov/aes.
24. J. Patarin. New results on pseudorandom permutations generators based on the DES scheme. In J. Feigen-baum, editor, Advances in Cryptology - CRYPTO '91, LNCS 576, pages 301-312. Springer-Verlag, Berlin, 1992.
25. J. Patarin. How to construct pseudorandom and super pseudorandom permutations from one single pseudorandom function. In R.A. Rueppel, editor, Advances in Cryptology - EUROCRYPT '92, LNCS 658, pages 256-266. Springer-Verlag, Berlin, 1993.
26. J. Patarin. About Feistel schemes with six (or more) rounds. In S. Vaudenay, editor, Fast Software Encryption, Fifth International Workshop, FSE '98, Paris, France, March 1998, LNCS 1372, pages 103-121. Springer-Verlag, Berlin, 1998.
27. B. Sadeghiyan and J. Pieprzyk. A construction for super pseudorandom permutations from a single pseudorandom function. In R.A. Rueppel, editor, Advances in Cryptology - EUROCRYPT '92, LNCS 658, pages 267-284. Springer-Verlag, Berlin, 1993.
28. P.C. van Oorschot and M.J. Wiener. Improving implementable meet-in-the-middle attacks of orders of magnitude. In N. Koblitz, editor, Advances in Cryptology-CRYPTO '96, LNCS 1109, pages 229-236. Springer-Verlag, Berlin, 1996.
29. P.C. van Oorschot and M.J. Wiener. Parallel collision search with cryptanalytic applications. Journal of Cryptology, 12(1):1-28, 1999.
30. M.J. Wiener. Efficient DES key search. Technical Report TR-244, School of Computer Science, Carleton University, Ottawa, May 1994. Presented at the Rump Session of CRYPTO '93.
31. M.J. Wiener. Efficient DES key search - an update. CryptoBytes, 3(2):6-8, 1998.