On optimal bounds of small inverse problems and approximate GCD problems with higher degree
From MaRDI portal
(Redirected from Publication:4648490)
Recommendations
- General bounds for small inverse problems and its applications to multi-prime RSA
- On the optimality of lattices for the Coppersmith technique
- Maximizing small root bounds by linearization and applications to small secret exponent RSA
- scientific article; zbMATH DE number 1182510
- Solving linear equations modulo unknown divisors: revisited
Cited in
(15)- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- On the optimality of lattices for the Coppersmith technique
- Small CRT-exponent RSA revisited
- Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
- Cryptanalysis of the RSA variant based on cubic Pell equation
- Generalized cryptanalysis of small CRT-exponent RSA
- General bounds for small inverse problems and its applications to multi-prime RSA
- Small CRT-Exponent RSA Revisited
- Partial prime factor exposure attacks on some RSA variants
- A generalized attack on a new variant of the RSA cryptosystem
- Cryptanalysis of some algebraic variants of the RSA cryptosystem
- Generalized cryptanalysis of cubic Pell RSA
- A new generalized lattice attack against a family of RSA-like cryptosystems
- Cryptanalysis of a new variant of the RSA cryptosystem
- A generalized partial exposure lattice attack against an RSA variant based on cubic Pell curves
This page was built for publication: On optimal bounds of small inverse problems and approximate GCD problems with higher degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4648490)
