Cryptology ePrint Archive: Report 2021/1238

Generic Framework for Key-Guessing Improvements

Marek Broll and Federico Canale and Antonio Flórez-Gutiérrez and Gregor Leander and 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.

Category / Keywords: secret-key cryptography / cryptanalysis, S-box, key-guessing, affine decision trees

Original Publication (with major differences): IACR-ASIACRYPT-2021

Date: received 18 Sep 2021, last revised 23 Sep 2021

Contact author: antonio florez-gutierrez at inria fr, gregor leander at rub de, marek broll at rub de, Federico Canale at rub de, maria naya_plasencia at inria fr

Available format(s): PDF | BibTeX Citation

Version: 20210923:141815 (All versions of this report)

Short URL: ia.cr/2021/1238


[ Cryptology ePrint archive ]