Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

SACRYPT
2001
Springer

favoriteEmaildiscussreport

97views Cryptology» more SACRYPT 2001»

A Simple Algebraic Representation of Rijndael

13 years 9 months ago

A Simple Algebraic Representation of Rijndael

Download www.macfergus.com

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.

Niels Ferguson, Richard Schroeppel, Doug Whiting

Real-time Traffic

Closed Algebraic Formula | Cryptology | Rijndael Block Cipher | SACRYPT 2001 | Untested Hardness Assumption |

claim paper

Related Content

» Some Algebraic Aspects of the Advanced Encryption Standard

» Algebraic SideChannel Attacks on the AES Why Time also Matters in DPA

» General Principles of Algebraic Attacks and New Design Criteria for Cipher Components

» Fast and Simple Relational Processing of Uncertain Data

» Pseudomonadic Algebras as Algebraic Models of Doxastic Modal Logic

» On Exact Algebraic NonImmunity of SBoxes Based on Power Functions

» How Fast can be Algebraic Attacks on Block Ciphers

» TradeOffs Between Grounded and Abstract Representations Evidence From Algebra Problem Solv...

» System Description ARA An Automatic Theorem Prover for Relation Algebras

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	SACRYPT
Authors	Niels Ferguson, Richard Schroeppel, Doug Whiting

Comments (0)