Probability method for cryptanalysis of general multivariate modular linear equation
From MaRDI portal
Recommendations
- Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses
- scientific article; zbMATH DE number 4187707
- Linear cryptanalysis using multiple linear approximations
- Linear cryptanalysis using multiple approximations
- On probability of success in linear and differential cryptanalysis
- On probability of success in linear and differential cryptanalysis
- Multidimensional linear cryptanalysis
- Linear cryptanalysis using multiple approximations and FEAL
- Cryptanalysis of Rational Multivariate Public Key Cryptosystems
Cites work
- A sieve algorithm for the shortest lattice vector problem
- Cryptanalysis of General Lu-Lee Type Systems
- Cryptanalysis: a survey of recent results
- Factoring polynomials with rational coefficients
- Fast LLL-type lattice reduction
- Floating-Point LLL Revisited
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- On Lovász' lattice reduction and the nearest lattice point problem
- Predicting Lattice Reduction
- The two faces of lattices in cryptology
Cited in
(2)
This page was built for publication: Probability method for cryptanalysis of general multivariate modular linear equation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848370)