Toward a Rigorous Variation of Coppersmith’s Algorithm on Three Variables
From MaRDI portal
Recommendations
- Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA
- Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- scientific article; zbMATH DE number 1341877
- On the optimality of lattices for the Coppersmith technique
Cited in
(17)- On the optimality of lattices for the Coppersmith technique
- Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA
- A note on the bivariate Coppersmith theorem
- Easing Coppersmith methods using analytic combinatorics: applications to public-key cryptography with weak pseudorandomness
- On the optimality of lattices for the Coppersmith technique
- A method for solving of polynomial congruence
- Small secret exponent attack on RSA variant with modulus N=p^rq
- A new attack on RSA and Demytko's elliptic curve cryptosystem
- Forty years of attacks on the RSA cryptosystem: a brief survey
- Using LLL-reduction for solving RSA and factorization problems
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications
- Inferring sequences produced by the quadratic generator
- New Results of Breaking the CLS Scheme from ACM-CCS 2014
- Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves
- Better bounds for finding fixed-degree isogenies via Coppersmith's method
- Leveled isogeny problems with hints
This page was built for publication: Toward a Rigorous Variation of Coppersmith’s Algorithm on Three Variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429401)
