Cryptology ePrint Archive: Report 2002/157
In How Many Ways Can You Write Rijndael?
Elad Barkan and Eli Biham
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
Category / Keywords: secret-key cryptography / AES, Galois Field, Dual Cipher, Self Dual, Logarithm
Publication Info: Asiacrypt 2002.
Date: received 16 Oct 2002
Contact author: barkan at cs technion ac il
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation
Note: An earlier version of this paper appears in Asiacrypt 2002.
See also ''The Book of Rijndaels''.
Version: 20021016:182553 (All versions of this report)
Short URL: ia.cr/2002/157
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]