Welcome to the resource topic for 2020/1051
Title:
Lower Bounds on the Degree of Block Ciphers
Authors: Phil Hebborn, Baptiste Lambin, Gregor Leander, 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.
ePrint: https://eprint.iacr.org/2020/1051
Talk: https://www.youtube.com/watch?v=nMZKm0i6vzU
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .