A simple algebraic representation of Rijndael

success fail Sep NOV Dec 04 2005 2006 2008 61 captures 06 Jun 2003 - 16 Jan 2016 About this capture COLLECTED BY Collection: Accelovation Crawl Web crawl snapshots generously donated from Accelovation. This data is currently not publicly accessible.

From the site: Accelovation is pioneering the delivery of Insight Discoveryâ¢ software solutions that help companies move from innovation idea to product reality faster and with more success.

Our solutions are used by leading firms in the Fortune 500 and beyond â companies from a diverse set of industries ranging from consumer packaged goods to high tech, foods to chemicals, and others. We help them mine the online world for market and technical insights to help speed the process of innovation.
TIMESTAMPS AES Home About Publications Practical Cryptography

Niels Ferguson, Richard Schroeppel, and Doug Whiting

In Selected Areas in Cryptography, Proc. SAC 2001, Lecture Notes in Computer Science #2259, pp. 103–111, Springer Verlag, 2001.

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.

Download

Zipped PostScript (53 kB)
PDF (142 kB)

Home About Publications Practical Cryptography