Paper 2021/931 Original: eprint.iacr.org/2021/931 ↗

Practical Key Recovery Attacks on FlexAEAD

Orr Dunkelman
Maria Eichlseder
Daniel Kales
Nathan Keller
Gaëtan Leurent
Markus Schofnegger
Abstract

FlexAEAD is a block cipher candidate submitted to the NIST Lightweight Cryptography standardization project, based on repeated application of an Even-Mansour construction. In order to optimize performance, the designers chose a relatively small number of rounds, using properties of the mode and bounds on differential and linear characteristics to substantiate their security claims. Due to a forgery attack with complexity $2^{46}$, FlexAEAD was not selected to the second round of evaluation in the NIST project. In this paper we present a practical key recovery attack on FlexAEAD, using clusters of differentials for the internal permutation and the interplay between different parts of the mode. Our attack, which was fully verified in practice, allows recovering the secret subkeys of FlexAEAD-64 with a time complexity of less than $2^{31}$ encryptions (with an experimental success rate of $75\,\%$). This is the first practical key recovery attack on a candidate of the NIST standardization project.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Preprint.
History
2024-06-07: last updated
2021-07-09: published
Short URL
https://ia.cr/2021/931
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2021/931,
      author = {Orr Dunkelman and Maria Eichlseder and Daniel Kales and Nathan Keller and Gaëtan Leurent and Markus Schofnegger},
      title = {Practical Key Recovery Attacks on FlexAEAD},
      howpublished = {Cryptology {ePrint} Archive, Paper 2021/931},
      year = {2021},
      url = {https://eprint.iacr.org/2021/931}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.