Abstract
In this paper we consider the security ofblo ck ciphers which contain alternate layers of invertible S-boxes and affine mappings (there are many popular cryptosystems which use this structure, including the winner of the AES competition, Rijndael). We show that a five layer scheme with 128 bit plaintexts and 8 bit S-boxes is surprisingly weak even when all the S-boxes and affine mappings are key dependent (and thus completely unknown to the attacker). We tested the attack with an actual implementation, which required just 216 chosen plaintexts and a few seconds on a single PC to find the 217 bits of information in all the unknown elements of the scheme.
Chapter PDF
Similar content being viewed by others
Keywords
References
R. Anderson, E. Biham, L. Knudsen, Serpent: A Proposal for the AES, 1st AES Conference, 1998.
E. Biham, Cryptanalysis of Patarin’s 2-Round Public Key System with S-boxes (2R), proceedings of EUROCRYPT'2000, LNCS 1807, pp.408–416, Springer-Verlag, 2000.
J. Daemen, L. Knudsen, V. Rijmen, The Block Cipher Square, proceedings of FSE'97, LNCS 1267, pp.147–165, Springer-Verlag, 1997.
V. Rijmen, J. Daemen, AES Proposal: Rijndael, 1st AES Conference, 1998.
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
Biryukov, A., Shamir, A. (2001). Structural Cryptanalysis of SASAS. In: Pfitzmann, B. (eds) Advances in Cryptology — EUROCRYPT 2001. EUROCRYPT 2001. Lecture Notes in Computer Science, vol 2045. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44987-6_24
Download citation
DOI: https://doi.org/10.1007/3-540-44987-6_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42070-5
Online ISBN: 978-3-540-44987-4
eBook Packages: Springer Book Archive