On linear approximation of modulo sum
From MaRDI portal
Recommendations
- Linear Approximations of Addition Modulo 2n-1
- Linear approximations of addition modulo \(2^{n }\)
- On the best linear approximation of addition modulo \(2^n\)
- Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors
- Approximate congruence in nearly linear time
- scientific article; zbMATH DE number 1445323
- On the computational complexity of the solution of linear systems with moduli
- On the linear complexity of bounded integer sequences over different moduli
- Exploiting Linearity of Modular Multiplication
Cited in
(6)- Linear Approximations of Addition Modulo 2n-1
- Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors
- On the best linear approximation of addition modulo \(2^n\)
- On Large Distributions for Linear Cryptanalysis
- Linear approximations of addition modulo \(2^{n }\)
- On scatter properties of modular addition operation over imprimitivity systems of the translation group of the binary vector space
This page was built for publication: On linear approximation of modulo sum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713927)