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.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Cite
CITATION STYLE
Ferguson, N., Schroeppel, R., & Whiting, D. (2001). A simple algebraic representation of rijndael. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2259, pp. 103–111). Springer Verlag. https://doi.org/10.1007/3-540-45537-x_8
Readers over time
Readers' Seniority
Readers' Discipline
