{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T10:20:16Z","timestamp":1772878816829,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540429876","type":"print"},{"value":"9783540456827","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45682-1_3","type":"book-chapter","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T02:31:48Z","timestamp":1180146708000},"page":"36-51","source":"Crossref","is-referenced-by-count":35,"title":["The Modular Inversion Hidden Number Problem"],"prefix":"10.1007","author":[{"given":"Dan","family":"Boneh","sequence":"first","affiliation":[]},{"given":"Shai","family":"Halevi","sequence":"additional","affiliation":[]},{"given":"Nick","family":"Howgrave-Graham","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,11,20]]},"reference":[{"key":"3_CR1","unstructured":"E. Bach, J. Shallit, \u201cAlgorithmic number theory, Volume I: efficient algorithms\u201d, MIT press, 1996."},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"L. Blum, M. Blum, M. Shub, \u201cA simple unpredictable pseudo-random number generator\u201d, SIAM J. Comput. 15, 2 (1986) 364\u2013383.","journal-title":"SIAM J. Comput."},{"issue":"4","key":"3_CR3","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum and S. Micali. How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM J.Computing, 13(4):850\u2013864, November 1984.","journal-title":"SIAM J.Computing"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"D. Boneh, Venkatesan R., \u201cHardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes\u201d, Proc. of Crypto, 1996, pp. 129\u2013142, 1996.","DOI":"10.1007\/3-540-68697-5_11"},{"key":"3_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/3-540-44647-8_12","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"D. Boneh","year":"2001","unstructured":"D. Boneh, I. Shparlinksi, \u201cOn the unpredictability of bits of the elliptic curve Diffie-Hellman scheme\u201d, In Advances in Cryptology \u2014 CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pp. 201\u2013212. Springer-Verlag, 2001."},{"key":"3_CR6","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":"3_CR7","doi-asserted-by":"crossref","unstructured":"R. Cramer and V. Shoup, \u201cA practical public key cryptosystem provably secure against adaptive chosen ciphertext attack\u201d, in proc. Crypto\u2019 98, pp. 13\u201325, 1998.","DOI":"10.1007\/BFb0055717"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"R. Cramer and V. Shoup, \u201cSignature schemes based on the Strong RSA Assumption\u201d, Proc. 6th ACM Conf. on Computer and Communications Security, 1999.","DOI":"10.1145\/319709.319716"},{"key":"3_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/3-540-44598-6_29","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"R. Gennaro","year":"2000","unstructured":"R. Gennaro. An improved pseudo-random generator based on discrete log. In Advances in Cryptology \u2014 CRYPTO 2000, volume 1880 of Lecture Notes in Computer Science, pp. 469\u2013481. Springer-Verlag, 2000."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"R. Gennaro, S. Halevi, T. Rabin, \u201cSecure hash-and-sign signature without random oracles\u201d, Proc. Eurocrypt\u2019 99, pp. 123\u2013139, 1999.","DOI":"10.1007\/3-540-48910-X_9"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, D. Zuckerman, \u201cHow to Recycle Random Bits\u201d, FOCS, 1989.","DOI":"10.1109\/SFCS.1989.63486"},{"key":"3_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BFb0024458","volume-title":"Finding small roots of univariate modular equations revisited","author":"N. Howgrave-Graham","year":"1997","unstructured":"N. Howgrave-Graham. Finding small roots of univariate modular equations revisited. In proceedings Cryptography and Coding, Lecture Notes in Computer Science, vol. 1355, Springer-Verlag, pp. 131\u2013142, 1997."},{"key":"3_CR13","unstructured":"N. Howgrave-Graham, N. Smart. Lattice attacks on digital signature schemes. manuscript."},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A. Lenstra","year":"1982","unstructured":"A. Lenstra, H. Lenstra, and L. Lov\u00e1sz. Factoring polynomials with rational coefficients. Mathematische Annalen, vol. 261, pp. 515\u2013534, 1982.","journal-title":"Mathematische Annalen"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"M. Naor, O. Reingold, \u201cNumber theoretic constructions of efficient pseudo random functions\u201d, Proc. FOCS\u2019 97. pp. 458\u2013467.","DOI":"10.1109\/SFCS.1997.646134"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"A. Ta-Shma, D. Zuckerman, and S. Safra, \u201cExtractors from Reed-Muller Codes\u201d, FOCS, 2001.","DOI":"10.1109\/SFCS.2001.959940"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45682-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T06:47:51Z","timestamp":1556434071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45682-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429876","9783540456827"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45682-1_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}