{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:39:50Z","timestamp":1775839190348,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540663478","type":"print"},{"value":"9783540484059","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48405-1_21","type":"book-chapter","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T06:24:36Z","timestamp":1178000676000},"page":"326-337","source":"Crossref","is-referenced-by-count":58,"title":["Factoring N = p r q for Large r"],"prefix":"10.1007","author":[{"given":"Dan","family":"Boneh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Glenn","family":"Durfee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"Howgrave-Graham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,12,16]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF00198464","volume":"6","author":"D. Coppersmith","year":"1993","unstructured":"D. Coppersmith, \u201cModifications to the number field sieve\u201d, J. of Cryptology, Vol. 6, pp. 169\u2013180, 1993.","journal-title":"J. of Cryptology"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D. Coppersmith","year":"1997","unstructured":"D. Coppersmith, \u201cSmall solutions to polynomial equations, and low exponent RSA vulnerabilities\u201d, J. of Cryptology, Vol. 10, pp. 233\u2013260, 1997.","journal-title":"J. of Cryptology"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"A. Fujioke, T. Okamoto, S. Miyaguchi, \u201cESIGN: an efficient digital signature implementation for smartcards\u201d, In. proc. Eurocrypt\u2019 91, pp. 446\u2013457, 1991.","DOI":"10.1007\/3-540-46416-6_38"},{"issue":"2","key":"21_CR4","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1137\/0217019","volume":"17","author":"J. Hastad","year":"1988","unstructured":"J. Hastad, \u201cSolving simultaneous modular equations of low degree\u201d, SIAM J. of Computing, Vol. 17, No. 2, pp. 336\u2013341, 1988.","journal-title":"SIAM J. of Computing"},{"key":"21_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BFb0024458","volume-title":"Proc. of Cryptography and Coding","author":"N. Howgrave-Graham","year":"1997","unstructured":"N. Howgrave-Graham, \u201cFinding small roots of univariate modular equations revisited\u201d, Proc. of Cryptography and Coding, LNCS 1355, Springer-Verlag, 1997, pp. 131\u2013142."},{"key":"21_CR6","unstructured":"N. Howgrave-Graham, \u201cExtending LLL to Gaussian integers\u201d, Unpublished Manuscript, March 1998. http:\/\/www.bath.ac.uk\/~mapnahg\/pub\/gauss.ps"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"A. Lenstra, H.W. Lenstra Jr., \u201cAlgorithms in Number Theory\u201d, in Handbook of Theoretical Computer Science (Volume A: Algorithms and Complexity), ch. 12, pp. 673\u2013715, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50017-5"},{"key":"21_CR8","unstructured":"A. Lenstra, H.W. Lenstra Jr., \u201cThe development of the number field sieve\u201d, Lecture Notes in Mathematics, Vol. 1554, Springer-Verlag, 1994."},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A. Lenstra","year":"1982","unstructured":"A. Lenstra, H.W. Lenstra Jr., and L. Lovasz, \u201cFactoring polynomial with rational coefficients\u201d, Mathematiche Annalen, 261:515\u2013534, 1982.","journal-title":"Mathematiche Annalen"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H.W. Lenstra Jr.","year":"1987","unstructured":"H.W. Lenstra Jr., \u201cFactoring integers with elliptic curves\u201d, Annuals of Mathematics, 126:649\u2013673, 1987.","journal-title":"Annuals of Mathematics"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"L. Lovasz, \u201cAn algorithmic theory of numbers, graphs and convexity\u201d, SIAM lecture series, Vol. 50, 1986.","DOI":"10.1137\/1.9781611970203"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"T. Okamoto, S. Uchiyama, \u201cA new public key cryptosystem as secure as factoring\u201d, in Proc. Eurocrypt\u2019 98, pp. 310\u2013318, 1998.","DOI":"10.1007\/BFb0054135"},{"issue":"4","key":"21_CR13","first-page":"489","volume":"E79-A","author":"R. Peralta","year":"1996","unstructured":"R. Peralta, T. Okamoto, \u201cFaster factoring of integers of special form\u201d, IEICE Trans. Fundamentals, Vol. E79-A, No. 4, pp. 489\u2013493, 1996.","journal-title":"IEICE Trans. Fundamentals"},{"issue":"21","key":"21_CR14","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1049\/el:19820617","volume":"18","author":"J.J. Quisquater","year":"1982","unstructured":"J.J. Quisquater and C. Couvreur, \u201cFast deciperhment algorithm for RSA public-key cryptosystem\u201d, Electronic Letters, 18(21), pp. 905\u2013907, 1982.","journal-title":"Electronic Letters"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"R. Silverman, Wagstaff Jr., \u201cA Practical analysis of the elliptic curve factoring algorithm\u201d, Math. Comp. Vol 61, 1993.","DOI":"10.2307\/2152967"},{"issue":"3","key":"21_CR16","first-page":"1","volume":"1","author":"A. Shamir","year":"1995","unstructured":"A. Shamir, \u201cRSA for Paranoids\u201d, RSA Laboratories\u2019 CryptoBytes, vol. 1, no. 3, pp. 1\u20134, 1995.","journal-title":"CryptoBytes"},{"key":"21_CR17","unstructured":"V. Shoup, Number Theory Library (NTL), http:\/\/www.cs.wisc.edu\/~shoup\/ntl ."},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"T. Takagi, \u201cFast RSA-type cryptosystem modulo pkq\u201d, in Proc. Crypto\u2019 98, pp. 318\u2013326, 1998.","DOI":"10.1007\/BFb0055738"},{"key":"21_CR19","unstructured":"P. Zimmerman, private communications."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 99"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48405-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T12:35:28Z","timestamp":1556368528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48405-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540663478","9783540484059"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-48405-1_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}