On algebraic cryptanalysis of ciphers with low multiplicative complexity - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

On algebraic cryptanalysis of ciphers with low multiplicative complexity

Pavol Zajac
  • Function : Author
  • PersonId : 977028

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.
Fichier principal
Vignette du fichier
wcc15-fr1-1.pdf (221.31 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01276499 , version 1 (19-02-2016)

Identifiers

  • HAL Id : hal-01276499 , version 1

Cite

Pavol Zajac. On algebraic cryptanalysis of ciphers with low multiplicative complexity. The 9th International Workshop on Coding and Cryptography 2015 WCC2015, Anne Canteaut, Gaëtan Leurent, Maria Naya-Plasencia, Apr 2015, Paris, France. ⟨hal-01276499⟩

Collections

WCC2015
33 View
116 Download

Share

Gmail Facebook Twitter LinkedIn More