scientific article; zbMATH DE number 1852134

From MaRDI portal
Publication:4787196

zbMath1006.11081MaRDI QIDQ4787196

Don Coppersmith

Publication date: 9 January 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2146/21460020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (27)

Bounding basis reduction propertiesRecovering zeros of polynomials modulo a primeBalanced Integer Solutions of Linear EquationsList-decoding Barnes-Wall latticesReconstructing points of superelliptic curves over a prime finite fieldDeterministic factoring with oraclesOn the modular inversion hidden number problemCryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate PolynomialsFast practical lattice reduction through iterated compressionAlgebraic Cryptanalysis of CTRU CryptosystemSmooth factors of integers and elliptic curve based factoring with an oracleExtended partial key exposure attacks on RSA: improvement up to full size decryption exponentsOn oracle factoring of integersA Tool Kit for Partial Key Exposure Attacks on RSAPartial key exposure attacks on RSA: achieving the Boneh-Durfee boundOn the optimality of lattices for the Coppersmith techniqueSmall CRT-Exponent RSA RevisitedSmall CRT-exponent RSA revisitedFast LLL-type lattice reductionPredicting nonlinear pseudorandom number generatorsSmall solutions of polynomial congruencesUsing LLL-Reduction for Solving RSA and Factorization ProblemsSolving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption ExponentsIdeal forms of Coppersmith's theorem and Guruswami-Sudan list decodingPartial Key Exposure Attacks on RSA with Multiple Exponent PairsGeneralized cryptanalysis of small CRT-exponent RSA




This page was built for publication: