Cryptology ePrint Archive: Report 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.

Category / Keywords: secret-key cryptography / Block cipher Feistel SP algebraic degree balanced boolean functions

Publication Info: Presented at YACC 2008

Date: received 10 Feb 2010

Contact author: didier alquie at laposte net

Available format(s): PDF | BibTeX Citation

Version: 20100211:124713 (All versions of this report)

Short URL: ia.cr/2010/071

Discussion forum: Show discussion | Start new discussion