On CCZ-equivalence of Addition mod 2n - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

On CCZ-equivalence of Addition mod 2n


We show that addition mod 2n is CCZ-equivalent to a quadratic vectorial Boolean function. We use this to reduce the solution of systems di erential equations of addition to the solution of a system of linear equations and to derive a fully explicit formula for the correlation coe cients, which leads to new results about the Walsh transform of addition mod 2n . The results have applications in the cryptanalysis of cyptographic primitives which use addition mod 2n .
Fichier principal
Vignette du fichier
113.pdf (145.22 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00607747 , version 1 (11-07-2011)


  • HAL Id : inria-00607747 , version 1


Ernst Schulte-Geers. On CCZ-equivalence of Addition mod 2n. WCC 2011 - Workshop on coding and cryptography, Apr 2011, Paris, France. pp.131-142. ⟨inria-00607747⟩
120 View
959 Download


Gmail Facebook X LinkedIn More