On the modular inversion hidden number problem

DOI10.1016/J.JSC.2011.09.002MaRDI QIDQ412197zbMATHOpenAlexFDO

Authors San Ling, Igor E. Shparlinski, Ron Steinfeld, Huaxiong Wang

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

zbMATH Keywords

inversionpseudorandom generatorshidden number problem

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• Close values of shifted modular inversions and the decisional modular inversion hidden number problem
• scientific article; zbMATH DE number 2081057
• New results on Modular Inversion Hidden Number problem and inversive congruential generator
• scientific article; zbMATH DE number 2086222
• Public Key Cryptography – PKC 2004

Cites work

• scientific article; zbMATH DE number 2081057 (Why is no real title available?)
• scientific article; zbMATH DE number 1852134 (Why is no real title available?)
• scientific article; zbMATH DE number 6472645 (Why is no real title available?)
• A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
• A hierarchy of polynomial time lattice basis reduction algorithms
• An LLL algorithm with quadratic complexity
• An LLL-reduction algorithm with quasi-linear time complexity, extended abstract
• Cryptography and Coding
• Finding short lattice vectors within Mordell's inequality
• Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
• Playing ``hide-and-seek with numbers: the hidden number problem, lattices and exponential sums
• Predicting nonlinear pseudorandom number generators
• Reconstructing noisy polynomial evaluation in residue rings
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Solving Hidden Number Problem with One Bit Oracle and Advice

Cited in

(13)

• Solving Hidden Number Problem with One Bit Oracle and Advice
• Close values of shifted modular inversions and the decisional modular inversion hidden number problem
• The MMO problem
• The Hidden Root Problem
• On the bit security of elliptic curve Diffie-Hellman
• Solving a class of modular polynomial equations and its relation to modular inversion hidden number problem and inversive congruential generator
• Improving bounds on elliptic curve hidden number problem for ECDH key exchange
• New results on Modular Inversion Hidden Number problem and inversive congruential generator
• Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
• Finding significant Fourier coefficients: clarifications, simplifications, applications and limitations
• The hidden number problem with non-prime modulus
• Cryptanalysis of elliptic curve hidden number problem from PKC 2017
• scientific article; zbMATH DE number 2081057 (Why is no real title available?)

This page was built for publication: On 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 Q412197)