Cited By
View all- Hong DSung JMoriai SLee SLim J(2001)Impossible Differential Cryptanalysis of ZodiacRevised Papers from the 8th International Workshop on Fast Software Encryption10.5555/647936.741070(300-311)Online publication date: 2-Apr-2001
Differential cryptanalysis of Lucifer
Pages 21 - 34
Abstract
Differential cryptanalysis was introduced as an approach to analyze the security of DES-like cryptosystems. The first example of a DES-like cryptosystem was Lucifer, the direct predecessor of DES, which is still believed by many people to be much more secure than DES, since it has 128 key bits, and since no attacks against (the full variant of) Lucifer were ever reported in the cryptographic literature. In this paper we introduce a new extension of differential cryptanalysis, devised to extend the class of vulnerable cryptosystems. This new extension suggests key-dependent characteristics, calledconditional characteristics, selected to increase the characteristics' probabilities for keys in subsets of the key space. The application of conditional characteristics to Lucifer shows that more than half of the keys of Lucifer are insecure, and the attack requires about 236 complexity and chosen plaintexts to find these keys. The same extension can also be used to attack a new variant of DES, called RDES, which was designed to be immune against differential cryptanalysis. These new attacks flash new light on the design of DES, and show that the transition of Lucifer to DES strengthened the later cryptosystem.
References
[1]
C. M. Adams, On immunity against Biham and Shamir's 'differential cryptanalysis', Information Processing Letters, Vol. 41, No. 2, pp. 77-80, 1992.
[2]
E. Biham and A. Shamir, Differential cryptanalysis of DES-like cryptosystems, Journal of Cryptology, Vol. 4, No. 1, pp. 3-72, 1991.
[3]
E. Biham and A. Shamir, Differential cryptanalysis of FEAL and N-Hash (extended abstract), Advances in Cryptology, Proceedings of EUROCRYPT '91, Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 1-16, 1991.
[4]
E. Biham and A. Shamir, Differential cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer (extended abstract), Advances in Cryptology, Proceedings of CRYPTO '91, Springer-Verlag, Berlin, pp. 156-171, 1991.
[5]
E. Biham and A. Shamir, Differential cryptanalysis of the full 16-round DES, Advances in Cryptology, Proceedings of CRYPTO '92, Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 487-496, 1992.
[6]
E. Biham and A. Shamir, Differential Cryptanalysis of the Data Encryption Standard, Springer-Verlag, New York, 1993.
[7]
L. Brown, M. Kwan, J. Pieprzyk, and J. Seberry, Improving resistance to differential cryptanalysis and the redesign of LOKI, Advances in Cryptology, Proceedings of ASIACRYPT '91, Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 36-50, 1991.
[8]
L. Brown, J. Pieprzyk, and J. Seberry, LOKI--a cryptographic primitive for authentication and secrecy applications, Advances in Cryptology, Proceedings of AUSCRYPT '90, Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 229-236, 1990.
[9]
M. H. Dawson and S. E. Tavares, An expanded set of S-box design criteria based on information theory and its relation to differential-like attacks, Advances in Cryptology, Proceedings of EUROCRYPT '91, Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 352-367, 1991.
[10]
H. Feistel, Cryptography and data security, Scientific American, Vol. 228, No. 5, pp. 15-23, May 1973.
[11]
K. Koyama and R. Terada, How to strengthen DES-like cryptosystems against differential cryptanalysis, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science, Vol. E76- A, No. 1, pp. 63-69, January 1993.
[12]
X. Lai and J. L. Massey, A proposal for a new block encryption standard, Advances in Cryptology, Proceedings of EUROCRYPT '90, Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 389- 404, 1990.
[13]
X. Lai, J. L. Massey, and S. Murphy, Markov ciphers and differential cryptanalysis, Advances in Cryptology, Proceedings of EUROCRYPT '91, Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 17-38, 1991.
[14]
R. C. Merkle, A fast software one-way hash function, Journal of Cryptology, Vol. 3, No. 1, pp. 43-58, 1990.
[15]
R. C. Merkle, Fast software encryption functions, Advances in Cryptology, Proceedings of CRYPTO '90, Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 476-501, 1990.
[16]
S. Miyaguchi, K. Ohta, and M. Iwata, 128-Bit hash function (N-Hash), Proceedings of SECURICOM '90, pp. 123-137, March 1990.
[17]
S. Miyaguchi, A. Shiraishi, and A. Shimizu, Fast data encryption algorithm FEAL-8, Review of Electrical Communications Laboratories, Vol. 36, No. 4, pp. 433-437, 1988.
[18]
National Bureau of Standards, Data Encryption Standard, U.S. Department of Commerce, FIPS Publication 46, January 1977.
[19]
K. Nyberg, Perfect nonlinear S-boxes, Advances in Cryptology, Proceedings of EUROCRYPT '91, Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 378-386, 1991.
[20]
L. O'Connor, On the distribution of characteristics in bijective mappings, Advances in Cryptology, Proceedings of EUROCRYPT '93, Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 360- 370, 1993.
[21]
L. O'Connor, On the distribution of characteristics in composite permutations, Advances in Cryptology, Proceedings of CRYPTO '93, Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 403-412, 1993.
[22]
A. Shimizu and S. Miyaguchi, Fast data encryption algorithm FEAL, Advances in Cryptology, Proceedings of EUROCRYPT '87, Lecture Notes in Computer Science, Springer-Verlag, Berlin, pp. 267-278, 1987.
[23]
A. Sorkin, Lucifer, a cryptographic algorithm, Cryptologia, Vol. 8, No. 1, pp. 22-41, January 1984.
[24]
M. C. Wood, Technical report, Cryptech Inc., Jamestown, NY, July 1990.
- Differential cryptanalysis of Lucifer
Recommendations
Differential cryptanalysis of WARP
AbstractWARP is an energy-efficient lightweight block cipher that is currently the smallest 128-bit block cipher in terms of hardware. It was proposed by Banik et al. in SAC 2020 as a lightweight replacement for AES-128 without ...
The Triangle Differential Cryptanalysis
Information Security and PrivacyAbstractIn this paper, a new variant of differential cryptanalysis is developed by applying the idea of the boomerang attack on the truncated differential. We call this variant a triangle differential cryptanalysis since it utilizes the difference of ...
Differential cryptanalysis of PRESENT-like cipher
In 2011, Borghoff et al. introduced a slender-set differential cryptanalysis on PRESENT-like ciphers with key-dependent S-boxes. Borghoff's differential attack mainly divides into two parts: data collection phase and S-box recovery phase. In this paper, ...
Comments
Information & Contributors
Information
Published In
Copyright © Copyright © 1996 International Association for Cryptologic Research.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 01 March 1996
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Feb 2025
Other Metrics
Citations
Cited By
View all- Hong DSung JMoriai SLee SLim J(2001)Impossible Differential Cryptanalysis of ZodiacRevised Papers from the 8th International Workshop on Fast Software Encryption10.5555/647936.741070(300-311)Online publication date: 2-Apr-2001