A simple algebraic representation of rijndael

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2259, Issue , 2001, Pages 103-111

  Ferguson, Niels ^a   Schroeppel, Richard ^b   Whiting, Doug ^c  

^a Counterpane Internet Security ^*  (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

^c Hi fn   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; SECURITY OF DATA;

ALGEBRAIC FORMULAS; ALGEBRAIC REPRESENTATIONS; BLOCK CIPHERS; RIJNDAEL; SECURITY CRITICAL APPLICATIONS;

ALGEBRA;

EID: 84949194630     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45537-x_8     Document Type: Conference Paper

References (5)

1. 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.
2. 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
3. Matthew Kwan. Reducing the gate count of bitslice DES. Cryptology ePrint Archive, Report 2000/051, 2000. http://eprint.iacr.org/.
4. Kurt Mehlhorn. Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1984.
5. Sean Murphy and Matt Robshaw. New observations on Rijndael. Available from http://www.isg.rhul.ac.uk/mrobshaw/, August 2000. Preliminary Draft