International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

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

Authors:
Didier Alqui\'e
Download:
URL: http://eprint.iacr.org/2010/071
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2010-22972,
  title={2-round Substitution-Permutation and 3-round Feistel Networks have bad Algebraic Degree},
  booktitle={IACR Eprint archive},
  keywords={secret-key cryptography / Block cipher Feistel SP algebraic degree balanced boolean functions},
  url={http://eprint.iacr.org/2010/071},
  note={Presented at YACC 2008 didier.alquie@laposte.net 14650 received 10 Feb 2010},
  author={Didier Alqui\'e},
  year=2010
}