Obtaining and solving systems of equations in key variables only for the small variants of AES
From MaRDI portal
Publication:626949
DOI10.1007/s11786-009-0020-yzbMath1205.94076OpenAlexW2127222268MaRDI QIDQ626949
Michael Brickenstein, Stanislav Bulygin
Publication date: 19 February 2011
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-009-0020-y
Cryptography (94A60) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Solving polynomial systems; resultants (13P15)
Related Items (2)
Algebraic Attacks Using Binary Decision Diagrams ⋮ ОБЗОР АТАК НА AES-128: К ПЯТНАДЦАТИЛЕТИЮ СТАНДАРТА AES
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New developments in the theory of Gröbner bases and applications to formal verification
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Slimgb: Gröbner bases with slim polynomials
- Algebraic Techniques in Differential Cryptanalysis
- An Analysis of XSL Applied to BES
- A Zero-Dimensional Gröbner Basis for AES-128
- Related-Key Cryptanalysis of the Full AES-192 and AES-256
- In How Many Ways Can You Write Rijndael?
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
- SINGULAR
- Advanced Encryption Standard – AES
- Advances in Cryptology - CRYPTO 2003
- An Analysis of the XSL Algorithm
- MRHS Equation Systems
- Fast Software Encryption
- Algebraic Methods in Side-Channel Collision Attacks and Practical Collision Detection
- A Gröbner Basis Approach to CNF-Formulae Preprocessing
- Cryptography and Coding
- Topics in Cryptology – CT-RSA 2006
This page was built for publication: Obtaining and solving systems of equations in key variables only for the small variants of AES
