Paper 2020/1051 Original: eprint.iacr.org/2020/1051 ↗
Lower Bounds on the Degree of Block Ciphers
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
- Preprint.
- History
- 2020-09-01: last updated
- 2020-09-01: published
- Short URL
- https://ia.cr/2020/1051
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}