The modular inversion hidden number problem

DOI10.1007/3-540-45682-1_3MaRDI QIDQ4474164zbMATH OpenFDO

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

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

approximationsCoppersmith's attackHidden number problemslatticesMACmodular inversionPRNG

Mathematics Subject Classification ID

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

Recommendations

• New results on Modular Inversion Hidden Number problem and inversive congruential generator
• On the modular inversion hidden number problem
• Close values of shifted modular inversions and the decisional modular inversion hidden number problem
• Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator
• Playing ``hide-and-seek with numbers: the hidden number problem, lattices and exponential sums

Cited in

(25)

• Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator
• New results on Modular Inversion Hidden Number problem and inversive congruential generator
• Cryptanalysis of elliptic curve hidden number problem from PKC 2017
• Close values of shifted modular inversions and the decisional modular inversion hidden number problem
• More efficient DDH pseudorandom generators
• Limits of a conjecture on a leakage-resilient cryptosystem
• Recovering zeros of polynomials modulo a prime
• On the modular inversion hidden number problem
• Predicting nonlinear pseudorandom number generators
• Using LLL-reduction for solving RSA and factorization problems
• A hidden number problem in small subgroups
• On the bit security of elliptic curve Diffie-Hellman
• 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
• 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
• Threshold linear secret sharing to the rescue of MPC-in-the-head
• Solving the hidden number problem for CSIDH and CSURF via automated Coppersmith
• Computing asymptotic bounds for small roots in Coppersmith's method via sumset theory
• Solving multivariate Coppersmith problems with known moduli
• Enhanced bound for the commutative isogeny hidden number problem in CSURF
• New results on elliptic curve hidden number problem for ECDH key exchange
• Formalizing the hidden number problem in Isabelle/HOL
• QUAD: A multivariate stream cipher with provable security

This page was built for publication: The modular inversion hidden number problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474164)