Attacks Against Filter Generators Exploiting Monomial Mappings - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Attacks Against Filter Generators Exploiting Monomial Mappings


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 mono-mial 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.
Fichier principal
Vignette du fichier
final-fse16.pdf (385.34 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01401009 , version 1 (22-11-2016)



Anne Canteaut, Yann Rotella. Attacks Against Filter Generators Exploiting Monomial Mappings. Fast Software Encrytion - FSE 2016, Mar 2016, Bochum, Germany. pp.78 - 98, ⟨10.1007/978-3-662-52993-5_5⟩. ⟨hal-01401009⟩


103 View
370 Download



Gmail Mastodon Facebook X LinkedIn More