scientific article; zbMATH DE number 1852134
From MaRDI portal
Publication:4787196
zbMath1006.11081MaRDI QIDQ4787196
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.
Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Lattices and convex bodies (number-theoretic aspects) (11H06) Factorization (11Y05)
Related Items (27)
Bounding basis reduction properties ⋮ Recovering zeros of polynomials modulo a prime ⋮ Balanced Integer Solutions of Linear Equations ⋮ List-decoding Barnes-Wall lattices ⋮ Reconstructing points of superelliptic curves over a prime finite field ⋮ Deterministic factoring with oracles ⋮ On the modular inversion hidden number problem ⋮ Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials ⋮ Fast practical lattice reduction through iterated compression ⋮ Algebraic Cryptanalysis of CTRU Cryptosystem ⋮ Smooth factors of integers and elliptic curve based factoring with an oracle ⋮ Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents ⋮ On oracle factoring of integers ⋮ A Tool Kit for Partial Key Exposure Attacks on RSA ⋮ 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 ⋮ Small CRT-exponent RSA revisited ⋮ Fast LLL-type lattice reduction ⋮ Predicting nonlinear pseudorandom number generators ⋮ Small solutions of polynomial congruences ⋮ Using LLL-Reduction for Solving RSA and Factorization Problems ⋮ Solving 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 Exponents ⋮ Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding ⋮ Partial Key Exposure Attacks on RSA with Multiple Exponent Pairs ⋮ Generalized cryptanalysis of small CRT-exponent RSA
This page was built for publication:
