Abstract
We show that there is a very straightforward closed algebraic formula for the Rijndael block cipher. This formula is highly structured and far simpler then algebraic formulations of any other block cipher we know. The security of Rijndael depends on a new and untested hardness assumption: it is computationally infeasible to solve equations of this type. The lack of research on this new assumption raises concerns over the wisdom of using Rijndael for security-critical applications.
Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy under Contract DE-AC04-94AL85000.
Chapter PDF
References
Joan Daemen and Vincent Rijmen. AES proposal: Rijndael. In AES Round 1 Technical Evaluation, CD-1: Documentation. NIST, August 1998. See http://www.esat.kuleuven.ac.be/~rijmen/rijndael/ or http://www.nist.gov/aes.
Niels Ferguson, John Kelsey, Stefan Lucks, Bruce Schneier, Mike Stay, David Wagner, and Doug Whiting. Improved cryptanalysis of Rijndael. In Bruce Schneier, editor, Fast Software Encryption 2000, volume 1978 of Lecture Notes in Computer Science. Springer-Verlag, 2000.
Matthew Kwan. Reducing the gate count of bitslice DES. Cryptology ePrint Archive, Report 2000/051, 2000. http://eprint.iacr.org/.
Kurt Mehlhorn. Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1984.
Sean Murphy and Matt Robshaw. New observations on Rijndael. Available from http://www.isg.rhul.ac.uk/mrobshaw/, August 2000. Preliminary Draft.
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
Ferguson, N., Schroeppel, R., Whiting, D. (2001). A Simple Algebraic Representation of Rijndael. In: Vaudenay, S., Youssef, A.M. (eds) Selected Areas in Cryptography. SAC 2001. Lecture Notes in Computer Science, vol 2259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45537-X_8
Download citation
DOI: https://doi.org/10.1007/3-540-45537-X_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43066-7
Online ISBN: 978-3-540-45537-0
eBook Packages: Springer Book Archive