{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T00:49:15Z","timestamp":1781657355114,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424888","type":"print"},{"value":"9783540446705","type":"electronic"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44670-2_6","type":"book-chapter","created":{"date-parts":[[2007,5,7]],"date-time":"2007-05-07T08:45:28Z","timestamp":1178527528000},"page":"51-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":129,"title":["Approximate Integer Common Divisors"],"prefix":"10.1007","author":[{"given":"Nick","family":"Howgrave-Graham","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,9,17]]},"reference":[{"key":"6_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of Eurocrypt\u201996","author":"D. Coppersmith","year":"1996","unstructured":"D. Coppersmith. Finding a small root of a bivariate integer equation Proc. of Eurocrypt\u201996 Lecture Notes in Computer Science, Vol. 1233, Springer-Verlag, 1996"},{"issue":"2","key":"6_CR2","first-page":"203","volume":"46","author":"D. Boneh","year":"1999","unstructured":"D. Boneh. Twenty years of attacks on the RSA cryptosystem. Notices of the American Mathematical Society (AMS) Vol. 46, No. 2, pp. 203\u2013213, 1999.","journal-title":"Notices of the American Mathematical Society (AMS)"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1109\/18.850673","volume":"46","author":"D. Boneh","year":"2000","unstructured":"D. Boneh and G. Durfee. Cryptanalysis of RSA with private key d less than N0.292 IEEE Transactions on Information Theory, Vol 46, No. 4, pp. 1339\u20131349, July 2000.","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/3-540-49649-1_3","volume-title":"In proceedings AsiaCrypt\u201998","author":"D. Boneh","year":"1998","unstructured":"D. Boneh, G. Durfee and Y. Frankel. An attack on RSA given a small fraction of the private key bits. In proceedings AsiaCrypt\u201998, Lecture Notes in Computer Science, Vol. 1514, Springer-Verlag, pp. 25\u201334, 1998."},{"key":"6_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/3-540-48405-1_21","volume-title":"Proceedings Crypto\u2019 99","author":"D. Boneh","year":"1999","unstructured":"D. Boneh, G. Durfee and N. Howgrave-Graham Factoring N = p\n                        r\n                        q for large r. In Proceedings Crypto\u2019 99, Lecture Notes in Computer Science, Vol. 1666, Springer-Verlag, pp. 326\u2013337, 1999."},{"key":"6_CR6","unstructured":"G.H. Hardy and E.M. Wright. An introduction to the theory of numbers, 5\u2019th edition. Oxford University press, 1979."},{"key":"6_CR7","unstructured":"N.A. Howgrave-Graham. Computational mathematics inspired by RSA. Ph.D. Thesis, Bath University, 1999."},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"A.K. Lenstra, H.W. Lenstra and L. Lov\u00e1sz. Factoring polynomials with integer coefficients Mathematische Annalen, Vol. 261, pp. 513\u2013534, 1982.","journal-title":"Mathematische Annalen"},{"issue":"2","key":"6_CR9","first-page":"168","volume":"16","author":"K.L. Manders","year":"1978","unstructured":"K.L. Manders and L.M. Adleman. NP-Complete decision problems for binary quadratics JCSS Vol. 16(2), pp. 168\u2013184, 1978.","journal-title":"JCSS"},{"key":"6_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/10722028_4","volume-title":"Algorithmic Number Theory-Proc. of ANTS-IV","author":"P. Nguyen","year":"2000","unstructured":"P. Nguyen and J. Stern. Lattice reduction in cryptology: An update\u201d, Algorithmic Number Theory-Proc. of ANTS-IV, volume 1838 of LNCS. Springer-Verlag, 2000."},{"issue":"11","key":"6_CR11","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1049\/el:19860395","volume":"22","author":"T. Okamoto","year":"1986","unstructured":"T. Okamoto. Fast public-key cryptosystem using congruent polynomial equations Electronic letters, Vol. 22, No. 11, pp. 581\u2013582, 1986.","journal-title":"Electronic letters"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C.-P. Schnorr","year":"1987","unstructured":"C-P. Schnorr. A hierarchy of polynomial time lattice bases reduction algorithms Theoretical computer science, Vol. 53, pp. 201\u2013224, 1987.","journal-title":"Theoretical computer science"},{"key":"6_CR13","unstructured":"V. Shoup. NTL: A Library for doing Number Theory (version 4.2) \n                    http:\/\/www.shoup.net"},{"key":"6_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/3-540-45961-8_26","volume-title":"Proceedings of Eurocrypt\u2019 88","author":"B. Vall\u00e9e","year":"1988","unstructured":"B. Vall\u00e9e, M. Girault and P. Toffin. Proceedings of Eurocrypt\u2019 88 LNCS vol. 330, pp. 281\u2013291, 1988."},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/18.54902","volume":"36","author":"M. Wiener","year":"1990","unstructured":"M. Wiener. Cryptanalysis of short RSA secret exponents IEEE Transactions of Information Theory volume 36, pages 553\u2013558, 1990.","journal-title":"IEEE Transactions of Information Theory"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Lattices"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44670-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T21:57:21Z","timestamp":1675893441000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-44670-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424888","9783540446705"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44670-2_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"17 September 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}