Finding small solutions to small degree polynomials
From MaRDI portal
Recommendations
- A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
- Advances in Cryptology - EUROCRYPT 2004
- Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
- Finding small roots of univariate modular equations revisited
- An algorithm for finding small roots of multivariate polynomials over the integers
Cited in
(38)- 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
- Generalized cryptanalysis of small CRT-exponent RSA
- Bounding basis reduction properties
- List-decoding Barnes-Wall lattices
- Fast LLL-type lattice reduction
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
- On oracle factoring of integers
- Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents
- Partial key exposure attacks on RSA with multiple exponent pairs
- Balanced integer solutions of linear equations
- Cryptographic applications of capacity theory: on the optimality of Coppersmith's method for univariate polynomials
- A tool kit for partial key exposure attacks on RSA
- Recovering zeros of polynomials modulo a prime
- An algorithm for finding small roots of multivariate polynomials over the integers
- Algebraic Cryptanalysis of CTRU Cryptosystem
- On the modular inversion hidden number problem
- On finding small solutions of modular multivariate polynomial equations
- scientific article; zbMATH DE number 1305293 (Why is no real title available?)
- Predicting nonlinear pseudorandom number generators
- Using LLL-reduction for solving RSA and factorization problems
- A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
- Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?
- Small CRT-Exponent RSA Revisited
- Reconstructing points of superelliptic curves over a prime finite field
- Deterministic factoring with oracles
- Fast practical lattice reduction through iterated compression
- Smooth factors of integers and elliptic curve based factoring with an oracle
- Finding small roots for bivariate polynomials over the ring of integers
- On the high dimensional RSA algorithm -- a public key cryptosystem based on lattice and algebraic number theory
- On the possibility of a backdoor in the Micali-Schnorr generator
- Solving multivariate Coppersmith problems with known moduli
- About LLL reduction algorithms when solving the HNP problem and their comparative analysis
- Elliptic-curve factoring, witnesses and oracles
- Lattices in function fields and applications
- Small solutions of polynomial congruences
This page was built for publication: Finding small solutions to small degree polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4787196)
