Abstract
Feistel ciphers are very common and very important in the design and analysis of blockciphers, especially due to four reasons: (1) Many (DES-like) ciphers are based on Feistel’s construction. (2) Luby and Rackoff proved the security of a four-round Feistel construction when the round functions are random. (3) Recently several provably secure ciphers were suggested, which use other (assumed secure) ciphers as the round function. (4) Other such ciphers use this construction as attempts to improve the security of other ciphers (e.g., to improve the security of DES).
In this paper we cryptanalyze Ladder-DES, a four-rounds Feistel cipher using DES in the round function, and show that its security is smaller than expected.
Chapter PDF
References
William Aiello, Ramarathnam Venkatesan, Foiling Birthday Attacks in Length-Doubling Transformations, Lecture Notes in Computer Science, Advances in Cryptology, proceedings of EUROCRYPT’96, pp. 307–320, 1996.
Ross Anderson, Eli Biham, Two Practical and Provably Secure Block Ciphers: BEAR and LION, proceedings of Fast Software Encryption, Cambridge, Lecture Notes in Computer Science, pp. 113–120, 1996.
W. Diffie, M. E. Hellman, Exhaustive Cryptanalysis of the NBS Data Encryption Standard, Computer, Vol. 10, No. 6, pp. 74–84, June 1977.
M. Luby, C. Rackoff, How to construct pseudorandom permutations from pseduorandom functions, SIAM Journal on Computing, Vol. 17, No. 2, pp. 373–386, 1988.
Stefan Lucks, Faster Luby-Rackoff Ciphers, proceedings of Fast Software Encryption, Cambridge, Lecture Notes in Computer Science, pp. 189–203, 1996.
Stefan Lucks, BEAST: A Fast Block Cipher for Arbitrary Blocksizes, 1996.
Shoji Miyaguchi, Akira Shiraishi, Akihiro Shimizu, Fast Data Encryption Algorithm FEAL-8, Review of electrical communications laboratories, Vol. 36, No. 4, pp. 433–437, 1988.
National Bureau of Standards, Data Encryption Standard, U.S. Department of Commerce, FIPS pub. 46, January 1977.
Terry Ritter, Ladder-DES: A Proposed Candidate to Replace DES, appeared in the Usenet newsgroup sci.crypt, February 1994.
Ingrid Schaumuller-Bichl, On the Design and Analysis of New Cipher Systems Related to the DES, technical report, Linz university, 1983.
Akihiro Shimizu, Shoji Miyaguchi, Fast Data Encryption Algorithm FEAL, Lecture Notes in Computer Science, Advances in Cryptology, proceedings of EUROCRYPT’87, pp. 267–278, 1987.
Arthur Sorkin, Lucifer, a Cryptographic Algorithm, Cryptologia, Vol. 8, No. 1, pp. 22–41, January 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
Biham, E. (1997). Cryptanalysis of Ladder-DES. In: Biham, E. (eds) Fast Software Encryption. FSE 1997. Lecture Notes in Computer Science, vol 1267. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052341
Download citation
DOI: https://doi.org/10.1007/BFb0052341
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63247-4
Online ISBN: 978-3-540-69243-0
eBook Packages: Springer Book Archive