Abstract
We introduce polynomial approximations and consider the particular case of quadratic approximations. We establish an isomorphism between the set of quadratic Boolean functions and graphs. As its consequence, we can reduce problems involvingquadratic Boolean functions into problems with graphs and vice-versa. We present the problem of findinga minimum representation of quadratic functions, and prove bounds on the number of terms and variables. With these bounds, we were able to find quadratic relations with the highest probabilities for SERPENT and CRYPTON, former AES candidates.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
E. Biham and A. Shamir, “Differential cryptanalysis of the full 16-round DES”, Proc. of CRYPTO’92, Lec. Notes in C.S, Springer-Verlag, 1992
E. Biham and A. Shamir, “Differential cryptanalysis of Data Encryption Standard”, Springer-Verlag, 1993.
M. Matsui, “The first experimental cryptanalysis of the Data Encryption Standard”, Proceedings of Crypto’94, Lec. Notes in C.S. number 839, Springer-Verlag, 1994
National Bureau of Standards, “Data Encryption Standards”, FIPS Publication 46, U. S. Dept. of Commerce, 1977
R. Anderson, E. Biham and L. Knudsen, “Serpent: a proposal for the Advanced Encryption Standard”, AES proposal available on: http://csrc.nist.gov/encryption/aes/
C. H. Lim, “CRYPTON: A new 128-bit block cipher”, AES proposal available on: http://csrc.nist.gov/encryption/aes/
C. H. Lim, “A revisited version of CRYPTON: CRYPTON V1.0”, Proceedings of Fast Software Encryption 1999, Lec. Notes in C.S. Springer-Verlag, 1999
P.G. Pinheiro and R. Terada, “Quadratic cryptanalysis of SAFER and CRYPTON”-working paper (May 2001).
Thomas Jakobsen, “Cryptanalysis of Block Ciphers with Probabilistic Non-Linear Relations of Low Degree”. Crypto’98, in Lecture Notes in Computer Science, Springer-Verlag, 1998.
Shiho Moriai, Takeshi Shimoyama, Toshinobu Kaneko, “Interpolation Attacks of the Block Cipher: SNAKE”, Fast Software Encryption Workshop’99, FSE’99, (Rome, March, 1999).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Terada, R., Pinheiro, P.G. (2001). Quadratic Relations for S-Boxes: Their Minimum Representations and Bounds. In: Davida, G.I., Frankel, Y. (eds) Information Security. ISC 2001. Lecture Notes in Computer Science, vol 2200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45439-X_20
Download citation
DOI: https://doi.org/10.1007/3-540-45439-X_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42662-2
Online ISBN: 978-3-540-45439-7
eBook Packages: Springer Book Archive