Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLing, Sanen
dc.contributor.authorShparlinski, Igor E.en
dc.contributor.authorSteinfeld, Ronen
dc.contributor.authorWang, Huaxiongen
dc.identifier.citationLing, S., Shparlinski, I.E., Steinfeld, R., & Wang, H. (2011). On the modular inversion hidden number problem. Journal of Symbolic Computation, 47(4), 358-367.en
dc.description.abstractWe 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.en
dc.format.extent11 p.en
dc.relation.ispartofseriesJournal of symbolic computationen
dc.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:
dc.titleOn the modular inversion hidden number problemen
dc.typeJournal Articleen
dc.contributor.schoolSchool of Physical and Mathematical Sciencesen
dc.description.versionAccepted versionen
item.fulltextWith Fulltext-
Appears in Collections:SPMS Journal Articles
Files in This Item:
File Description SizeFormat 
On the Modular Inversion Hidden Number.PDF335.69 kBAdobe PDFThumbnail

Citations 20

Updated on Mar 18, 2023

Web of ScienceTM
Citations 50

Updated on Mar 17, 2023

Page view(s) 10

Updated on Mar 19, 2023

Download(s) 20

Updated on Mar 19, 2023

Google ScholarTM




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