On the modular inversion hidden number problem
From MaRDI portal
Publication:412197
DOI10.1016/j.jsc.2011.09.002zbMath1248.11103OpenAlexW2093082154MaRDI QIDQ412197
Ron Steinfeld, Igor E. Shparlinski, Huaxiong Wang, San Ling
Publication date: 4 May 2012
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2011.09.002
Symbolic computation and algebraic computation (68W30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)
Related Items
Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator ⋮ 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 ⋮ On the Bit Security of Elliptic Curve Diffie–Hellman ⋮ Cryptanalysis of elliptic curve hidden number problem from PKC 2017 ⋮ Unnamed Item ⋮ Close values of shifted modular inversions and the decisional modular inversion hidden number problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hierarchy of polynomial time lattice basis reduction algorithms
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
- Solving Hidden Number Problem with One Bit Oracle and Advice
- Reconstructing noisy polynomial evaluation in residue rings
- Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
- An LLL Algorithm with Quadratic Complexity
- Predicting nonlinear pseudorandom number generators
- An LLL-reduction algorithm with quasi-linear time complexity
- Cryptography and Coding
This page was built for publication: On the modular inversion hidden number problem
