Welcome to the resource topic for 2010/071
Title:
2-round Substitution-Permutation and 3-round Feistel Networks have bad Algebraic Degree
Authors: Didier Alquié
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.
ePrint: https://eprint.iacr.org/2010/071
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 .