Abstract
This paper presents several methods to construct trapdoor block ciphers. A trapdoor cipher contains some hidden structure; knowledge of this structure allows an attacker to obtain information on the key or to decrypt certain ciphertexts. Without this trapdoor information the block cipher seems to be secure. It is demonstrated that for certain block ciphers, trapdoors can be built-in that make the cipher susceptible to linear cryptanalysis; however, finding these trapdoors can be made very hard, even if one knows the general form of the trapdoor. In principle such a trapdoor can be used to design a public key encryption scheme based on a conventional block cipher.
F.W.O research assistant, sponsored by the Fund for Scientific Research — Flanders (Belgium).
F.W.O. postdoctoral researcher, sponsored by the Fund for Scientific Research — Flanders (Belgium).
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
C.M. Adams, S.E. Tavares, Designing S-boxes for ciphers resistant to differential cryptanalysis, Proceedings of the 3rd Symposium on State and Progress of Research in Cryptography, W. Wolfowicz, Ed., Fondazione Ugo Bordoni, 1993, pp. 181–190.
K.G. Beauchamp, Walsh Functions and Their Applications, Academic Press, New York, 1975.
E. Biham, A. Shamir, Differential Cryptanalysis of the Data Encryption Standard, Springer-Verlag, 1993.
A. Blum, M. Furst, M. Kearns, R.J. Lipton, “Cryptographic primitives based on hard learning problems,≓ Advances in Cryptology, Proceedings Crypto’93, LNCS 773, D. Stinson, Ed., Springer-Verlag, 1994, pp. 278–291.
L. Brown, M. Kwan, J. Pieprzyk, J. Seberry, “Improving resistance against differential cryptanalysis and the redesign of LOKI,≓ Advances in Cryptology, Proceedings Asiacrypt’91, LNCS 739, H. Imai, R.L. Rivest, and T. Matsumoto, Eds., Springer-Verlag, 1993, pp. 36–50.
D. Coppersmith, S. Winograd, “Matrix multiplication via arithmetic progressions,≓ Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 1987, pp. 1–6.
J.F. Dillon, “Elementary Hadamard difference sets,≓ Proceedings of the Sixth Southeastern Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, Congressum Numerantium No. XIV, Utilitas Math., Winnipeg, Manitoba, 1975, pp. 237–249.
H. Feistel, W.A. Notz, J.L. Smith, “Some cryptographic techniques for machine-to-machine data communications,≓ Proceedings IEEE, Vol. 63, No. 11, November 1975, pp. 1545–1554.
FIPS 46, Data Encryption Standard, NBS, U.S. Department of Commerce, Washington D.C., Jan. 1977.
H.M. Heys, S.E. Tavares, On the security of the CAST encryption algorithm, Canadian Conference on Electrical and Computer Engineering, pp. 332–335, Sept. 1994, Halifax, Canada.
L.R. Knudsen, M.J.B. Robshaw, “Non-linear approximations in linear cryptanalysis,≓ Advances in Cryptology, Proceedings Eurocrypt’96, LNCS 1070, U. Maurer, Ed., Springer-Verlag, 1996, pp. 224–236.
A.K. Lenstra, H.W. Lenstra, Jr., L. Lovász, “Factoring polynomials with rational coefficients,≓ Math. Annalen, No. 261, pp. 513–534, 1982.
M. Matsui, “On correlation between the order of S-boxes and the strength of DES,≓ Advances in Cryptology, Proceedings Eurocrypt’94, LNCS 950, A. De Santis, Ed., Springer-Verlag, 1995, pp. 366–375.
M. Matsui, “The first experimental cryptanalysis of the Data Encryption Standard,≓ Advances in Cryptology, Proceedings Crypto’94, LNCS 839, Y. Desmedt, Ed., Springer-Verlag, 1994, pp. 1–11.
M.E. Smid, D.K. Branstad, “The Data Encryption Standard. Past and future,≓ in “Contemporary Cryptology: The Science of Information Integrity,≓ G.J. Simmons, Ed., IEEE Press, 1991, pp. 43–64.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
Rijmen, V., Preneel, B. (1997). A family of trapdoor ciphers. In: Biham, E. (eds) Fast Software Encryption. FSE 1997. Lecture Notes in Computer Science, vol 1267. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052342
Download citation
DOI: https://doi.org/10.1007/BFb0052342
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