Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
From MaRDI portal
Recommendations
- Advances in Cryptology - EUROCRYPT 2004
- Finding a small root of a bivariate integer equation; factoring with high bits known
- A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
- An algorithm for finding small roots of multivariate polynomials over the integers
- scientific article; zbMATH DE number 1182510
Cited in
(30)- A note on the bivariate Coppersmith theorem
- Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices
- Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents
- Finding a small root of a bivariate integer equation; factoring with high bits known
- A new partial key exposure attack on multi-power RSA
- A tool kit for partial key exposure attacks on RSA
- Recovering zeros of polynomials modulo a prime
- Implicit related-key factorization problem on the RSA cryptosystem
- An algorithm for finding small roots of multivariate polynomials over the integers
- On the Improvement of the BDF Attack on LSBS-RSA
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- scientific article; zbMATH DE number 1182510 (Why is no real title available?)
- scientific article; zbMATH DE number 1852134 (Why is no real title available?)
- Advances in Cryptology - EUROCRYPT 2004
- A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
- Rounding and chaining LLL: finding faster small roots of univariate polynomial congruences
- Toward a Rigorous Variation of Coppersmith’s Algorithm on Three Variables
- RSA Moduli with a Predetermined Portion: Techniques and Applications
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits
- Recovering a sum of two squares decomposition revisited
- Reconstructing points of superelliptic curves over a prime finite field
- Deterministic factoring with oracles
- Implicit-key attack on the RSA cryptosystem
- Finding small roots for bivariate polynomials over the ring of integers
- Revisiting RSA-polynomial problem and semiprime factorization
- Computing asymptotic bounds for small roots in Coppersmith's method via sumset theory
- Solving modular linear equations via automated Coppersmith and its applications
- Better bounds for finding fixed-degree isogenies via Coppersmith's method
- Trapdoor DDH groups from pairings and isogenies
This page was built for publication: Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612560)
