On the best linear approximation of addition modulo 2ⁿ

DOI10.1007/S12095-016-0203-8zbMATH Open1409.94911OpenAlexW2513812333MaRDI QIDQ520073FDOQ520073

Xiaoyuan Yang, Shuai Xue, Wenfeng 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

correlationaddition modulo \(2^n\)linear approximationlinear cryptanalysis

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast Computation of Large Distributions and Its Cryptographic Applications
• Linear Approximations of Addition Modulo 2n-1
• Improved Linear Distinguishers for SNOW 2.0
• Fast Software Encryption
• Fast Software Encryption

Cited In (3)

• On scatter properties of modular addition operation over imprimitivity systems of the translation group of the binary vector space
• Fast Software Encryption
• Linear Approximations of Addition Modulo 2n-1

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q520073)