scientific article; zbMATH DE number 2081057

zbMath1062.94545MaRDI QIDQ4474164

Dan Boneh, Shai Halevi, N. A. Howgrave-Graham

Publication date: 4 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2248/22480036.htm

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

zbMATH Keywords

approximationslatticesMACPRNGmodular inversionCoppersmith's attackHidden number problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (16)

More efficient DDH pseudorandom generators ⋮ Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator ⋮ Recovering zeros of polynomials modulo a prime ⋮ Reconstructing points of superelliptic curves over a prime finite field ⋮ The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications ⋮ On the modular inversion hidden number problem ⋮ Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection ⋮ Improving bounds on elliptic curve hidden number problem for ECDH key exchange ⋮ Fast practical lattice reduction through iterated compression ⋮ Limits of a conjecture on a leakage-resilient cryptosystem ⋮ On the Bit Security of Elliptic Curve Diffie–Hellman ⋮ Predicting nonlinear pseudorandom number generators ⋮ Using LLL-Reduction for Solving RSA and Factorization Problems ⋮ QUAD: A multivariate stream cipher with provable security ⋮ Cryptanalysis of elliptic curve hidden number problem from PKC 2017 ⋮ Close values of shifted modular inversions and the decisional modular inversion hidden number problem

This page was built for publication: