On CCZ-equivalence of addition mod \(2^n\)
From MaRDI portal
Publication:1934237
DOI10.1007/s10623-012-9668-4zbMath1259.94055OpenAlexW2059193699MaRDI QIDQ1934237
Publication date: 28 January 2013
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-012-9668-4
Walsh transformCCZ-equivalenceaddition mod \(2^n\)differential equations of additionquadratic vectorial Boolean function
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Boolean functions (06E30)
Related Items (11)
A bit-vector differential model for the modular addition by a constant and its applications to differential and impossible-differential cryptanalysis ⋮ A correlation attack on full SNOW-V and SNOW-Vi ⋮ Implicit white-box implementations: white-boxing ARX ciphers ⋮ Differential cryptanalysis in the fixed-key model ⋮ On scatter properties of modular addition operation over imprimitivity systems of the translation group of the binary vector space ⋮ Linear cryptanalysis of reduced-round SPECK ⋮ A bit-vector differential model for the modular addition by a constant ⋮ Improved Cryptanalysis on SipHash ⋮ On CCZ-equivalence, extended-affine equivalence, and function twisting ⋮ Automatic Search for the Best Trails in ARX: Application to Block Cipher Speck ⋮ Automatic Search of Linear Trails in ARX with Applications to SPECK and Chaskey
Cites Work
This page was built for publication: On CCZ-equivalence of addition mod \(2^n\)