Paper 2022/695 Original: eprint.iacr.org/2022/695 ↗
Yet Another Algebraic Cryptanalysis of Small Scale Variants of AES
Abstract
This work presents new advances in algebraic cryptanalysis of small scale derivatives of AES. We model the cipher as a system of polynomial equations over GF(2), which involves only the variables of the initial key, and we subsequently attempt to solve this system using Gröbner bases. We show, for example, that one of the attacks can recover the secret key for one round of AES-128 under one minute on a contemporary CPU. This attack requires only two known plaintexts and their corresponding ciphertexts. We also compare the performance of Gröbner bases to a SAT solver, and provide an insight into the propagation of diffusion within the cipher.
Metadata
- Available format(s)
PDF- Category
- Attacks and cryptanalysis
- Publication info
- Preprint.
- History
- 2022-07-18: last updated
- 2022-06-01: published
- Short URL
- https://ia.cr/2022/695
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2022/695,
author = {Marek Bielik and Martin Jureček and Olha Jurečková and Róbert Lórencz},
title = {Yet Another Algebraic Cryptanalysis of Small Scale Variants of AES},
howpublished = {Cryptology {ePrint} Archive, Paper 2022/695},
year = {2022},
url = {https://eprint.iacr.org/2022/695}
}