A zero-dimensional Gröbner basis for AES-128

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

Volumn 4047 LNCS, Issue , 2006, Pages 78-88

  Buchmann, Johannes ^a   Pyshkin, Andrei ^a   Weinmann, Ralf Philipp ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

AES; Block ciphers; Gr bner bases; Rijndael

Indexed keywords

COMPUTATION THEORY; SECURITY OF DATA;

BLOCK CIPHERS; GRÖBNER BASES; RIJNDAEL;

PROBLEM SOLVING;

EID: 33746684290     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11799313_6     Document Type: Conference Paper

References (17)

1. David Bayer and Michael Stillman. On the complexity of computing syzygies. Journal of Symbolic Computation, 6(2/3):135-147, 1988.
2. Thomas Becker and Volker Weispfenning. Gröbner Bases - A Computational Approach to Commutative Algebra. Springer-Verlag, 1991.
3. Bruno Buchberger. Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. PhD thesis, University of Innsbruck, Austria, 1965.
4. Bruno Buchberger. A criterion for Detecting Unnecessary Reductions in the Construction of Groebner Bases, volume 72, pages 3-21, London, UK, 1979. Johannes Kepler University Linz, Springer, Berlin - Heidelberg - New York.
5. Johannes Buchmann, Andrei Pyshkin, and Ralf-Philipp Weinmann. Block Ciphers Sensitive to Gröbner Basis Attacks. In Topics in Cryptology - CT-RSA 2006, volume 3860 of Lecture Notes in Computer Science, pages 313-331. Springer, 2006.
6. Carlos Cid and Gaëtan Leurent. An analysis of the XSL Algorithm. In Roy Bimal, editor, Advances in Cryptology - ASIACRYPT 2005, volume 3788 of Lecture Notes in Computer Science, pages 333-345. Springer, 2005.
7. Stéphane Collart, Michael Kalkbrener, and Daniel Mall. Converting Bases with the Gröbner Walk. Journal of Symbolic Computation, 24(3/4):465-469, 1997.
8. Nicolas Courtois and Josef Pieprzyk. Cryptanalysis of Block Ciphers with Overdefined Systems of Equations. In Yuliang Zheng, editor, Advances in Cryptology - ASIACRYPT 2002, volume 2501 of Lecture Notes in Computer Science, pages 267-287. Springer, 2002.
9. David A. Cox, John B. Little, and Don O'Shea. Ideals, Varieties, and Algorithms. Springer-Verlag, NY, 2nd edition, 1996. 536 pages.
10. Jean-Charles Faugère. A New Efficient Algorithm for Computing Gröbner bases (F4). Journal of Pure and Applied Algebra, 139(1-3):61-88, June 1999.
11. 5). In Symbolic and Algebraic Computation - ISSAC 2002, pages 75-83. ACM, 2002.
12. Jean-Charles Faugère, P. Gianni, Daniel Lazard, and Teo Mora. Efficient Computation of Zero-Dimensional Gröbner Bases by Change of Ordering. Journal of Symbolic Computation, 16(4):329-344, 1993.
13. Niels Ferguson, Richard Schroeppel, and Doug Whiting. A Simple Algebraic Representation of Rijndael. In Serge Vaudenay and Amr M. Youssef, editors, Selected Areas in Cryptography, volume 2259 of Lecture Notes in Computer Science, pages 103-111. Springer, 2001.
14. Michael Kalkbrener. On the Complexity of Gröbner Bases Conversion. Journal of Symbolic Computation, 28(1-2):265-273, 1999.
15. Sean Murphy and Matt Robshaw. Further Comments on the Structure of Rijndael. AES Comment to NIST, August 2000.
16. Sean Murphy and Matthew J.B. Robshaw. Essential Algebraic Structure within the AES. In Moti Yung, editor, Advances in Cryptology - CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 1-16. Springer, 2002.
17. National Institute of Standards and Technology. FIPS-197: Advanced Encryption Standard, November 2001. Available at http://csrc.nist.gov/publications/fips/.