Solving multivariate Coppersmith problems with known moduli
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3163858 (Why is no real title available?)
- scientific article; zbMATH DE number 4035724 (Why is no real title available?)
- scientific article; zbMATH DE number 1182510 (Why is no real title available?)
- scientific article; zbMATH DE number 1942424 (Why is no real title available?)
- scientific article; zbMATH DE number 2081057 (Why is no real title available?)
- scientific article; zbMATH DE number 217454 (Why is no real title available?)
- scientific article; zbMATH DE number 1852134 (Why is no real title available?)
- scientific article; zbMATH DE number 2223033 (Why is no real title available?)
- A New Lattice Construction for Partial Key Exposure Attack for RSA
- A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
- Advances in Cryptology - CRYPTO 2003
- Applied cryptography and network security. 7th international conference, ACNS 2009, Paris-Rocquencourt, France, June 2--5, 2009. Proceedings
- Approximate common divisors via lattices
- Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents
- Attacking power generators using unravelled linearization: when do we output too much?
- Cryptanalysis of RSA with Private Key d Less than N 0.292
- Cryptanalysis of elliptic curve hidden number problem from PKC 2017
- Cryptographic applications of capacity theory: on the optimality of Coppersmith's method for univariate polynomials
- Factoring polynomials with rational coefficients
- Fast practical lattice reduction through iterated compression
- Finding a small root of a univariate modular equation
- Further improvement of factoring RSA moduli with implicit hint
- Hermite’s Constant and Lattice Algorithms
- Improving bounds on elliptic curve hidden number problem for ECDH key exchange
- Information security practice and experience. 10th international conference, ISPEC 2014, Fuzhou, China, May 5--8, 2014. Proceedings
- Lattice points in simple polytopes
- Lattice-based integer factorisation: an introduction to Coppersmith's method
- Maximal Closure of a Graph and Applications to Combinatorial Problems
- Maximizing small root bounds by linearization and applications to small secret exponent RSA
- New results on Modular Inversion Hidden Number problem and inversive congruential generator
- On the optimality of lattices for the Coppersmith technique
- Partial Key Exposure Attacks on RSA up to Full Size Exponents
- Partial key exposure attack on short secret exponent CRT-RSA
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- Public Key Cryptography - PKC 2006
- Revisiting modular inversion hidden number problem and its applications
- Small CRT-Exponent RSA Revisited
- Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?
- Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator
- Solving linear equations modulo unknown divisors: revisited
- Solving the hidden number problem for CSIDH and CSURF via automated Coppersmith
- Using LLL-reduction for solving RSA and factorization problems
This page was built for publication: Solving multivariate Coppersmith problems with known moduli
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891206)
