On the modular inversion hidden number problem

We give a rigorous deterministic polynomial time algorithm for the modular inversion hidden number problem introduced by D. Boneh, S. Halevi and N.A. Howgrave-Graham in 2001. For our algorithm, we need to be given about 2/3 of the bits of the output, which matches one of the heuristic algorithms of D. Boneh, S. Halevi and N.A. Howgrave-Graham and answers one of their open questions. However their more efficient algorithm that requires only 1/3 of the bits of the output still remains heuristic.

[1]  Don Coppersmith,et al.  Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities , 1997, Journal of Cryptology.

[2]  Dan Boneh,et al.  Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes , 1996, CRYPTO.

[3]  Damien Stehlé,et al.  An LLL-reduction algorithm with quasi-linear time complexity: extended abstract , 2011, STOC '11.

[4]  Igor E. Shparlinski,et al.  Predicting the Inversive Generator , 2003, IMACC.

[5]  Dan Boneh,et al.  Rounding in lattices and its cryptographic applications , 1997, SODA '97.

[6]  Daniele Micciancio,et al.  A Deterministic Single Exponential Time Algorithm for Most Lattice Problems based on Voronoi Cell Computations ( Extended Abstract ) , 2009 .

[7]  Damien Stehlé,et al.  Solving the Shortest Lattice Vector Problem in Time 22.465n , 2009, IACR Cryptol. ePrint Arch..

[8]  Adi Akavia,et al.  Solving Hidden Number Problem with One Bit Oracle and Advice , 2009, CRYPTO.

[9]  Nicolas Gama,et al.  Finding short lattice vectors within mordell's inequality , 2008, STOC.

[10]  C. P. Schnorr,et al.  A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms , 1987, Theor. Comput. Sci..

[11]  Dan Boneh,et al.  The Modular Inversion Hidden Number Problem , 2001, ASIACRYPT.

[12]  Igor E. Shparlinski,et al.  Predicting nonlinear pseudorandom number generators , 2004, Math. Comput..

[13]  Igor E. Shparlinski,et al.  Reconstructing noisy polynomial evaluation in residue rings , 2006, J. Algorithms.

[14]  Damien Stehlé,et al.  An LLL Algorithm with Quadratic Complexity , 2009, SIAM J. Comput..

[15]  Ie Shparlinski.  Playing "hide-and-seek" with numbers: the hidden number problem, lattices and exponential sums , 2005 .