On algebraic cryptanalysis of ciphers with low multiplicative complexity

Abstract : In this article we study the application of multiple righthand sides (MRHS) equations in algebraic attacks against ciphers with low multiplicative complexity. Each AND gate in the circuit description is converted to a corresponding MRHS equation. The resulting system is transformed into a syndrome decoding problem. The complexity of the decoding problem then depends on the number of AND gates, and on the relative number of known output bits with respect to the number of unknown key bits. This allows us to apply results from coding theory, and explicitly connect the complexity of algebraic cryptanalysis to the multiplicative complexity of the cipher.
Type de document :
Communication dans un congrès
Pascale Charpin, Nicolas Sendrier, Jean-Pierre Tillich. The 9th International Workshop on Coding and Cryptography 2015 WCC2015, Apr 2015, Paris, France. 2016, 〈wcc2015.inria.fr〉
Liste complète des métadonnées

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

https://hal.inria.fr/hal-01276499
Contributeur : Jean-Pierre Tillich <>
Soumis le : vendredi 19 février 2016 - 14:48:55
Dernière modification le : lundi 22 février 2016 - 11:15:52
Document(s) archivé(s) le : samedi 12 novembre 2016 - 23:41:44

Fichier

wcc15-fr1-1.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01276499, version 1

Collections

Citation

Pavol Zajac. On algebraic cryptanalysis of ciphers with low multiplicative complexity. Pascale Charpin, Nicolas Sendrier, Jean-Pierre Tillich. The 9th International Workshop on Coding and Cryptography 2015 WCC2015, Apr 2015, Paris, France. 2016, 〈wcc2015.inria.fr〉. 〈hal-01276499〉

Partager

Métriques

Consultations de la notice

21

Téléchargements de fichiers

47