Skip to Main content Skip to Navigation
Conference papers

On CCZ-equivalence of Addition mod 2n

Abstract : 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 .
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/inria-00607747
Contributor : Assia Saadi Connect in order to contact the contributor
Submitted on : Monday, July 11, 2011 - 10:46:29 AM
Last modification on : Thursday, July 15, 2021 - 4:30:02 PM
Long-term archiving on: : Monday, November 12, 2012 - 10:40:50 AM

File

113.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00607747, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

114

Files downloads

729