Cryptology ePrint Archive: Report 2020/1051

Lower Bounds on the Degree of Block Ciphers

Phil Hebborn and Baptiste Lambin and Gregor Leander and Yosuke Todo

Abstract: Only the method to estimate the upper bound of the algebraic degree on block ciphers is known so far, but it is not useful for the designer to guarantee the security. In this paper we provide meaningful lower bounds on the algebraic degree of modern block ciphers.

Category / Keywords: secret-key cryptography / Block cipher, Algebraic degree, Minimum degree, Lower bounds, Division property, Parity set

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

Date: received 31 Aug 2020

Contact author: phil hebborn at rub de, baptiste lambin@protonmail com, gregor leander@rub de, yosuke todo xt@hco ntt co jp

Available format(s): PDF | BibTeX Citation

Version: 20200901:082655 (All versions of this report)

Short URL: ia.cr/2020/1051