Linear Approximations of Addition Modulo 2n-1
From MaRDI portal
Recommendations
- Linear approximations of addition modulo \(2^{n }\)
- On the best linear approximation of addition modulo \(2^n\)
- Fast Software Encryption
- Fast Modulo 2^{n} - (2^{n - 2} + 1) Addition: A New Class of Adder for RNS
- Approximate congruence in nearly linear time
- scientific article; zbMATH DE number 1445323
- On the addition of squares of units modulo n
- Exploiting Linearity of Modular Multiplication
- scientific article; zbMATH DE number 1305088
Cites work
- Correlation theorems in cryptanalysis
- Fast Computation of Large Distributions and Its Cryptographic Applications
- scientific article; zbMATH DE number 2089318 (Why is no real title available?)
- scientific article; zbMATH DE number 503328 (Why is no real title available?)
- scientific article; zbMATH DE number 1088939 (Why is no real title available?)
- scientific article; zbMATH DE number 1942441 (Why is no real title available?)
- scientific article; zbMATH DE number 1951604 (Why is no real title available?)
- scientific article; zbMATH DE number 1394292 (Why is no real title available?)
- Improved Linear Distinguishers for SNOW 2.0
- Linear approximations of addition modulo \(2^{n }\)
- On a Conjecture about Binary Strings Distribution
- Selected Areas in Cryptography
Cited in
(6)
This page was built for publication: Linear Approximations of Addition Modulo 2n-1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3013094)