{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T13:54:32Z","timestamp":1771595672699,"version":"3.50.1"},"reference-count":17,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1109\/tit.2011.2137270","type":"journal-article","created":{"date-parts":[[2011,5,25]],"date-time":"2011-05-25T17:48:10Z","timestamp":1306345690000},"page":"4002-4013","source":"Crossref","is-referenced-by-count":31,"title":["Approximate Integer Common Divisor Problem Relates to Implicit Factorization"],"prefix":"10.1109","volume":"57","author":[{"given":"Santanu","family":"Sarkar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhamoy","family":"Maitra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"ref11","author":"may","year":"2003","journal-title":"New RSA Vulnerabilities Using Lattice Reduction Methods"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00468-1_1"},{"key":"ref13","author":"regev","year":"2004","journal-title":"Lattices in Computer Science Lecture Notes"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"205","DOI":"10.3934\/amc.2009.3.205","article-title":"Further results on implicit factoring in polynomial time","volume":"3","author":"sarkar","year":"2009","journal-title":"Adv Math Commun"},{"key":"ref16","author":"sarkar","year":"2010","journal-title":"Approximate Integer Common Divisor Problem relates to Implicit Factorization All the Versions Available at Cryptology ePrint Archive Report 2009\/626 Submitted 18 Dec 2009 1st revision 11 Feb 2010 2nd revision 11 May 2010"},{"key":"ref17","author":"stinson","year":"2002","journal-title":"CryptographyTheory and Practice"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13013-7_5"},{"key":"ref3","first-page":"24","article-title":"Fully homomorphic encryption over the integers","volume":"6110","author":"dijk","year":"2010","journal-title":"Proc EUROCRYPT"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44670-2_6"},{"key":"ref5","first-page":"131","article-title":"Finding small roots of univariate modular equations revisited","volume":"1355","author":"howgravegraham","year":"1997","journal-title":"Coding and Cryptography"},{"key":"ref8","author":"jochemsz","year":"2007","journal-title":"Cryptanalysis of RSA Variants Using Small Roots of Polynomials"},{"key":"ref7","author":"ireland","year":"1998","journal-title":"A Classical Introduction to Modern Number Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-006-0433-6"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900030"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.43"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5773004\/05773038.pdf?arnumber=5773038","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:52:20Z","timestamp":1633909940000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5773038\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":17,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2137270","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6]]}}}