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

Generic Framework for Key-Guessing Improvements

Marek Broll
Federico Canale
Antonio Flórez-Gutiérrez
Gregor Leander
María Naya-Plasencia
Abstract

We propose a general technique to improve the key-guessing step of several attacks on block ciphers. This is achieved by defining and studying some new properties of the associated S-boxes and by representing them as a special type of decision trees that are crucial for finding fine-grained guessing strategies for various attack vectors. We have proposed and implemented the algorithm that efficiently finds such trees, and use it for providing several applications of this approach, which include the best known attacks on NOKEON, GIFT, and RECTANGLE.

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

BibTeX

@misc{cryptoeprint:2021/1238,
      author = {Marek Broll and Federico Canale and Antonio Flórez-Gutiérrez and Gregor Leander and María Naya-Plasencia},
      title = {Generic Framework for Key-Guessing Improvements},
      howpublished = {Cryptology {ePrint} Archive, Paper 2021/1238},
      year = {2021},
      url = {https://eprint.iacr.org/2021/1238}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.