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.
Type de document :
Communication dans un congrès
Fast Software Encrytion - FSE 2016, Mar 2016, Bochum, Germany. Springer, 9783, pp.78 - 98, 2016, Lecture Notes in Computer Science. 〈10.1007/978-3-662-52993-5_5〉
Liste complète des métadonnées

Littérature citée [41 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01401009
Contributeur : Anne Canteaut <>
Soumis le : mardi 22 novembre 2016 - 17:58:24
Dernière modification le : vendredi 2 décembre 2016 - 15:12:09
Document(s) archivé(s) le : mardi 21 mars 2017 - 00:43:09

Fichier

final-fse16.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Anne Canteaut, Yann Rotella. Attacks Against Filter Generators Exploiting Monomial Mappings. Fast Software Encrytion - FSE 2016, Mar 2016, Bochum, Germany. Springer, 9783, pp.78 - 98, 2016, Lecture Notes in Computer Science. 〈10.1007/978-3-662-52993-5_5〉. 〈hal-01401009〉

Partager

Métriques

Consultations de la notice

122

Téléchargements de fichiers

45