{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T10:27:38Z","timestamp":1775471258445,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540611868","type":"print"},{"value":"9783540683391","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-68339-9_16","type":"book-chapter","created":{"date-parts":[[2007,8,5]],"date-time":"2007-08-05T21:31:14Z","timestamp":1186349474000},"page":"178-189","source":"Crossref","is-referenced-by-count":177,"title":["Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known"],"prefix":"10.1007","author":[{"given":"Don","family":"Coppersmith","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"16_CR1","unstructured":"D. Coppersmith, \u201cFinding a Small Root of a Univariate Modular Equation,\u201d Proceedings of Eurocrypt 96."},{"key":"16_CR2","first-page":"513","volume":"261","author":"A. K. Lenstra","year":"1982","unstructured":"A. K. Lenstra, H. W. Lenstra and L. Lovasz, \u201cFactoring Polynomials with Integer Coefficients,\u201d Matematische Annalen 261 (1982), 513\u2013534.","journal-title":"Matematische Annalen"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"K. Manders and L. Adleman, \u201cNP-complete decision problems for binary quadratics,\u201d J. Comput. System Sci. 16, 168\u2013184.","DOI":"10.1016\/0022-0000(78)90044-2"},{"key":"16_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/3-540-47555-9_35","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201992","author":"U. M. Maurer","year":"1993","unstructured":"U. M. Maurer, \u201cFactoring with an Oracle,\u201d Advances in Cryptology \u2014 EUROCRYPT\u201992, Springer LNCS 658 (1993) 429\u2013436."},{"key":"16_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-39805-8_3","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201985","author":"R. L. Rivest","year":"1986","unstructured":"R. L. Rivest and A. Shamir, \u201cEfficient factoring based on partial information,\u201d Advances in Cryptology \u2014 EUROCRYPT\u201985, Springer LNCS 219 (1986) 31\u201334."},{"key":"16_CR6","series-title":"Lect Notes Comput Sci","first-page":"427","volume-title":"Proceedings of AAECC 6","author":"B. Vall\u00e9e","year":"1988","unstructured":"B. Vall\u00e9e, M. Girault and P. Toffin, \u201cHow to Guess \u2113-th Roots Modulo n by Reducing Lattice Bases,\u201d Proceedings of AAECC 6, Springer LNCS 357 (1988) 427\u2013442."},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF00190758","volume":"8","author":"S. A. Vanstone","year":"1995","unstructured":"S. A. Vanstone and R. J. Zuccherato, \u201cShort RSA Keys and Their Generation,\u201d Journal of Cryptology 8 number 2 (Spring 1995) 101\u2013114.","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201996"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68339-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T12:54:32Z","timestamp":1587819272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68339-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540611868","9783540683391"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-68339-9_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1996]]}}}