Cryptology ePrint Archive: Report 2016/384

Attacks against Filter Generators Exploiting Monomial Mappings

Anne Canteaut and Yann Rotella

Abstract: Filter generators are vulnerable to several attacks which have led to well-known design criteria on the Boolean filtering function. However, Rønjom and Cid have observed that a change of the primitive root defining the LFSR leads to several equivalent generators. They usually offer different security levels since they involve filtering functions of the form F(x^k) where k is coprime to (2^n-1) and n denotes the LFSR length. It is proved here that this monomial equivalence does not affect the resistance of the generator against algebraic attacks, while it usually impacts the resistance to correlation attacks. Most importantly, a more efficient attack can often be mounted by considering non-bijective monomial mappings. In this setting, a divide-and-conquer strategy applies based on a search within a multiplicative subgroup of F_{2^n}^*. Moreover, if the LFSR length n is not a prime, a fast correlation involving a shorter LFSR can be performed.

Category / Keywords: secret-key cryptography / Stream ciphers, correlation attacks, LFSR, filter generator, nonlinear equivalence, monomial

Original Publication (in the same form): IACR-FSE-2016

Date: received 15 Apr 2016

Contact author: Anne Canteaut at inria fr

Available format(s): PDF | BibTeX Citation

Version: 20160415:204405 (All versions of this report)

Short URL: ia.cr/2016/384

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]