Lower Bounds on the Degree of Block Ciphers

Phil Hebborn; Baptiste Lambin; Gregor Leander; Yosuke Todo

Paper 2020/1051

Lower Bounds on the Degree of Block Ciphers

Phil Hebborn, Baptiste Lambin, 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.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: A major revision of an IACR publication in ASIACRYPT 2020
Keywords: Block cipher Algebraic degree Minimum degree Lower bounds Division property Parity set
Contact author(s): phil hebborn @ rub de
baptiste lambin @ protonmail com
gregor leander @ rub de
yosuke todo xt @ hco ntt co jp
History: 2020-09-01: received
Short URL: https://ia.cr/2020/1051
License: CC BY

BibTeX

@misc{cryptoeprint:2020/1051,
      author = {Phil Hebborn and Baptiste Lambin and Gregor Leander and Yosuke Todo},
      title = {Lower Bounds on the Degree of Block Ciphers},
      howpublished = {Cryptology {ePrint} Archive, Paper 2020/1051},
      year = {2020},
      url = {https://eprint.iacr.org/2020/1051}
}