Skip to Main content Skip to Navigation
New interface
Conference papers

Attacks Against Filter Generators Exploiting Monomial Mappings

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 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [41 references]  Display  Hide  Download
Contributor : Anne Canteaut Connect in order to contact the contributor
Submitted on : Tuesday, November 22, 2016 - 5:58:24 PM
Last modification on : Wednesday, June 8, 2022 - 12:50:05 PM
Long-term archiving on: : Tuesday, March 21, 2017 - 12:43:09 AM


Files produced by the author(s)




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⟩



Record views


Files downloads