Abstract
In this paper we ask the question what happens if we replace all the constants in Rijndael, including the replacement of the irreducible polynomial, the coefficients of the MixColumn operation, the affine transformation in the S box, etc. We show that such replacements can create new dual ciphers, which are equivalent to the original in all aspects. We present several such dual ciphers of Rijndael, such as the square of Rijndael, and dual ciphers with the irreducible polynomial replaced by primitive polynomials. We also describe another family of dual ciphers consisting of the logarithms of Rijndael. We then discuss self-dual ciphers, and extend our results to other ciphers.
Chapter PDF
Similar content being viewed by others
References
Kazumaro Aoki, Tetsuya Ichikawa, Masayuki Kanda, Mitsuru Matsui, Shiho Moria, Junko Nakajima, Toshio Tokita, Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms-Design and Analysis, submitted to NESSIE, 2000.
Paulo S.L.M. Barreto, Vincent Rijmen, The Anubis Block Cipher, submitted to NESSIE, 2000.
Paulo S.L.M. Barreto, Vincent Rijmen, The Khazad Legacy-Level Block Cipher, submitted to NESSIE, 2000.
Eli Biham, Adi Shamir, Differential Cryptanalysis of the Data Encryption Standard, Springer-Verlag, 1993.
Eli Biham, Adi Shamir, Differential Fault of Secret-Key Crypto systems, Advances in Cryptology, proceedings of Crypto’97, Lecture Notes in Computer Science 1294, Springer-Verlag, pp. 513–525, 1997.
Antoon Bosselaers, Joan Daemen, Erik De Win, Bart Preneel, Vincent Rijmen, The Cipher Shark, proceedings of Fast Software Encryption’ 96, Lecture Notes in Computer Science 1039, Dieter Gollmann, Ed., Springer-Verlag, pp. 99–112, 1996.
Joan Daemen, Lars R. Knudsen, Vincent Rijmen, The Block Cipher Square, proceedings of Fast Software Encryption’ 97, Lecture Notes in Computer Science 1267, Eli Biham, Ed., Springer-Verlag, pp. 149–165, 1997.
Joan Daemen, Vincent Rijmen, AES Proposal: Rijndael, submitted to the Advanced Encryption Standard (AES) contest, 1998.
Niels Ferguson, Richard Schroeppel, Doug Whiting, A Simple Algebraic Representation of Rijndael, proceedings of Selected Areas in Cryptography, Lecture Notes in Computer Science 2259, Serge Vaudenay and Amr Youssef, Eds., Springer-Verlag, pp. 103–111, 2001.
Shai Halevi, Don Coppersmith, Charanjit Jutla, Scream: a Software-Efficient Stream Cipher, preproceedings of Fast Software Encryption 2002, pp. 190–204, 2002.
Thomas Jakobsen, Lars R. Knudsen, The Interpolation Attack on Block Ciphers, proceedings of Fast Software Encryption’ 97, Lecture Notes in Computer Science 1267, Eli Biham, Ed., Springer-Verlag, pp. 28–40, 1997.
Paul Kocher, Joshua Jaffe, Benjamin Jun, Differential Power Analysis, Advances in Cryptology, proceedings of Crypto’99, Lecture Notes in Computer Science 1666, Springer-Verlag, pp. 388–397, 1999.
Chae Hoon Lim, Crypton: a new 128-bit Block Cipher-Specifications and Analysis, submitted to the Advanced Encryption Standard (AES) contest, 1998.
James L. Massey, Gurgen H. Khachatrian, Melsik K. Kuregian, Nomination of Safer++ as Candidate Algorithm for the New European Schemes for Signatures, Integrity, and Encryption(NESSIE), submitted to NESSIE, 2000.
Mitsuru Matsui, Linear cryptanalysis method for DES cipher, Advances in Cryptology, proceedings of Eurocrypt’93, Lecture Notes in Computer Science 765, T. Helleseth, Ed., Springer-Verlag, pp. 386–397, 1994.
Nippon Telegraph and Telephone Corporation, AES Proposal: E2, submitted to the Advanced Encryption Standard (AES) contest, 1998.
National Institute of Standards and Technology, FIPS-197:Advanced Encryption Standard, Federal Information Processing Standard, FIPS-197, 2001.
Ronald L. Rivest, Adi Shamir, Leonard Adleman, A Method for Obtaining Digital Signatures and Public Key Crypto systems, Communications of the ACM, 21(2):120–126, 1978.
Serge Vaudenay, Alert on Non-Linearity: Linearities in RIJNDAEL, KASUMI,..., presented in the rump session of Crypto’01.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barkan, E., Biham, E. (2002). In How Many Ways Can You Write Rijndael?. In: Zheng, Y. (eds) Advances in Cryptology — ASIACRYPT 2002. ASIACRYPT 2002. Lecture Notes in Computer Science, vol 2501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36178-2_10
Download citation
DOI: https://doi.org/10.1007/3-540-36178-2_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00171-3
Online ISBN: 978-3-540-36178-7
eBook Packages: Springer Book Archive