Paper 2002/157 Original: eprint.iacr.org/2002/157 ↗
In How Many Ways Can You Write Rijndael?
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.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2002-10-16: last updated
- 2002-10-16: published
- Short URL
- https://ia.cr/2002/157
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2002/157,
author = {Elad Barkan and Eli Biham},
title = {In How Many Ways Can You Write Rijndael?},
howpublished = {Cryptology {ePrint} Archive, Paper 2002/157},
year = {2002},
url = {https://eprint.iacr.org/2002/157}
}