Paper 2010/071 Original: eprint.iacr.org/2010/071 ↗
2-round Substitution-Permutation and 3-round Feistel Networks have bad Algebraic Degree
Abstract
We study algebraic degree profile of reduced-round block cipher schemes. We show that the degree is not maximal with elementary combinatorial and algebraic arguments. We discuss on how it can be turned into distinguishers from balanced random functions.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2010-02-11: last updated
- 2010-02-11: published
- Short URL
- https://ia.cr/2010/071
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2010/071,
author = {Didier Alquié},
title = {2-round Substitution-Permutation and 3-round Feistel Networks have bad Algebraic Degree},
howpublished = {Cryptology {ePrint} Archive, Paper 2010/071},
year = {2010},
url = {https://eprint.iacr.org/2010/071}
}