2-round Substitution-Permutation and 3-round Feistel Networks have bad Algebraic Degree

You are looking at a specific version 20100211:124713 of this paper. See the latest version.

Paper 2010/071

2-round Substitution-Permutation and 3-round Feistel Networks have bad Algebraic Degree

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.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Published elsewhere. Presented at YACC 2008
Contact author(s): didier alquie @ laposte net
History: 2010-02-11: received
Short URL: https://ia.cr/2010/071
License: CC BY