Abstract
The security of DES-style block ciphers rests largely upon their non-linear S-boxes. If different pairs of input data and key can produce identical inputs to all of a cipher's S-boxes, then for those pairs the system is weakened. A technique is described here which enables a cryptanalyst to find how many of these pairs, if any, exist for a given cryptosystem, and how to exploit those pairs under a chosen plaintext attack.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
NBS, “Data Encryption Standard (DES),” FIPS PUB 46, US National Bureau of Standards, Washington, DC, JAN 1977.
M. Hellman, R. Merkle, R. Schroppel, L. Washington, W. Diffie, S. Pohlig, and P. Schweitzer, Results of an Initial Attempt to Cryptanalyze the NBS Data Encryption Standard, Stanford University, September 1976.
David Chaum and Jan-Hendrik Evertse, “Cryptanalysis of DES with a Reduced Number of Rounds Sequences of Linear Factors in Block Ciphers,” in Advances in Cryptology-Crypto 85, Lecture Notes in Computer Science, vol. 218, pp. 192–211, Springer-Verlag.
Lawrence Brown, Josef Pieprzyk, and Jennifer Seberry, “LOKI — A Cryptographic Primitive for Authentication and Secrecy Applications,” in Advances in Cryptology: Auscrypt'90, Lecture Notes in Computer Science, vol. 453, pp. 229–236, Springer-Verlag, 1990.
Lars Ramkilde Knudsen, “Cryptanalysis of LOKI,” in Advances in Cryptology — proceedings of ASIACRYPT'91, 1991.
E. Biham and A. Shamir, “Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer,” in Advances in Cryptology — proceedings of CRYPTO'91, 1991.
Richard Outerbridge, “Some Design Criteria for Feistel-Cipher Key Schedules,” Cryptologia, vol. 10, no. 3, pp. 142–156, JUL 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kwan, M., Pieprzyk, J. (1993). A general purpose technique for locating key scheduling weaknesses in DES-like cryptosystems. In: Imai, H., Rivest, R.L., Matsumoto, T. (eds) Advances in Cryptology — ASIACRYPT '91. ASIACRYPT 1991. Lecture Notes in Computer Science, vol 739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57332-1_19
Download citation
DOI: https://doi.org/10.1007/3-540-57332-1_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57332-6
Online ISBN: 978-3-540-48066-2
eBook Packages: Springer Book Archive