On the best linear approximation of addition modulo \(2^n\)

DOI10.1007/S12095-016-0203-8zbMath1409.94911OpenAlexW2513812333MaRDI QIDQ520073

Xiao-Yuan Yang, Shuai Xue, Wen-Feng Qi

Publication date: 3 April 2017

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-016-0203-8

zbMATH Keywords

correlationlinear approximationaddition modulo \(2^n\)linear cryptanalysis

Mathematics Subject Classification ID

Measures of association (correlation, canonical correlation, etc.) (62H20) Cryptography (94A60) Algorithms for approximation of functions (65D15) Diophantine approximation in probabilistic number theory (11K60)

Related Items (1)

On scatter properties of modular addition operation over imprimitivity systems of the translation group of the binary vector space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear Approximations of Addition Modulo 2n-1
• Improved Linear Distinguishers for SNOW 2.0
• Fast Computation of Large Distributions and Its Cryptographic Applications
• Fast Software Encryption
• Fast Software Encryption

This page was built for publication: On the best linear approximation of addition modulo \(2^n\)