Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/98740
Title: On the modular inversion hidden number problem
Authors: Ling, San
Shparlinski, Igor E.
Steinfeld, Ron
Wang, Huaxiong
Keywords: DRNTU::Science::Mathematics
Issue Date: 2011
Source: Ling, S., Shparlinski, I.E., Steinfeld, R., & Wang, H. (2011). On the modular inversion hidden number problem. Journal of Symbolic Computation, 47(4), 358-367.
Series/Report no.: Journal of symbolic computation
Abstract: 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 e cient algorithm that requires only 1/3 of the bits of the output still remains heuristic.
URI: https://hdl.handle.net/10356/98740
http://hdl.handle.net/10220/7718
DOI: 10.1016/j.jsc.2011.09.002
Rights: © 2011 Elsevier. This is the author created version of a work that has been peer reviewed and accepted for publication by Journal of Symbolic Computation, Elsevier. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: http://dx.doi.org.ezlibproxy1.ntu.edu.sg/10.1016/j.jsc.2011.09.002
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SPMS Journal Articles

Files in This Item:
File Description SizeFormat 
On the Modular Inversion Hidden Number.PDF335.69 kBAdobe PDFThumbnail
View/Open

SCOPUSTM   
Citations 20

8
Updated on Jan 19, 2023

Web of ScienceTM
Citations 50

5
Updated on Jan 25, 2023

Page view(s) 10

785
Updated on Feb 7, 2023

Download(s) 20

272
Updated on Feb 7, 2023

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.