Linear Approximations of Addition Modulo 2n-1
From MaRDI portal
Publication:3013094
DOI10.1007/978-3-642-21702-9_21zbMath1307.94115OpenAlexW1606402215MaRDI QIDQ3013094
Chuan-Kun Wu, Chunfang Zhou, Xiutao Feng
Publication date: 7 July 2011
Published in: Fast Software Encryption (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21702-9_21
Related Items (3)
A correlation attack on full SNOW-V and SNOW-Vi ⋮ An upper bound for the linearity of exponential Welch-Costas functions ⋮ On the best linear approximation of addition modulo \(2^n\)
Uses Software
Cites Work
- On a Conjecture about Binary Strings Distribution
- Improved Linear Distinguishers for SNOW 2.0
- Fast Computation of Large Distributions and Its Cryptographic Applications
- Selected Areas in Cryptography
- Fast Software Encryption
- Correlation theorems in cryptanalysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Linear Approximations of Addition Modulo 2n-1