Welcome to the resource topic for 2002/157
Title:
In How Many Ways Can You Write Rijndael?
Authors: Elad Barkan, 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
ciphers.
ePrint: https://eprint.iacr.org/2002/157
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .