scientific article; zbMATH DE number 1852134
From MaRDI portal
Publication:4787196
zbMATH Open1006.11081MaRDI QIDQ4787196FDOQ4787196
Authors: Don Coppersmith 
Publication date: 9 January 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2146/21460020
Title of this publication is not available (Why is that?)
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
- scientific article; zbMATH DE number 1182510
- An algorithm for finding small roots of multivariate polynomials over the integers
Cryptography (94A60) Lattices and convex bodies (number-theoretic aspects) (11H06) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16)
Cited In (34)
- Finding small roots for bivariate polynomials over the ring of integers
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- Generalized cryptanalysis of small CRT-exponent RSA
- On the optimality of lattices for the Coppersmith technique
- Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents
- Partial key exposure attacks on RSA with multiple exponent pairs
- Fast practical lattice reduction through iterated compression
- On the modular inversion hidden number problem
- List-decoding Barnes-Wall lattices
- A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
- Small CRT-exponent RSA revisited
- Small solutions of polynomial congruences
- Cryptographic applications of capacity theory: on the optimality of Coppersmith's method for univariate polynomials
- Algebraic Cryptanalysis of CTRU Cryptosystem
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
- On oracle factoring of integers
- On the high dimensional RSA algorithm -- a public key cryptosystem based on lattice and algebraic number theory
- An algorithm for finding small roots of multivariate polynomials over the integers
- Using LLL-reduction for solving RSA and factorization problems
- Title not available (Why is that?)
- Smooth factors of integers and elliptic curve based factoring with an oracle
- On the possibility of a backdoor in the Micali-Schnorr generator
- Reconstructing points of superelliptic curves over a prime finite field
- Fast LLL-type lattice reduction
- Title not available (Why is that?)
- Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?
- Bounding basis reduction properties
- Recovering zeros of polynomials modulo a prime
- Small CRT-Exponent RSA Revisited
- A tool kit for partial key exposure attacks on RSA
- Balanced integer solutions of linear equations
- Deterministic factoring with oracles
- Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
- Predicting nonlinear pseudorandom number generators
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4787196)
