{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:21:22Z","timestamp":1743027682575,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540004202"},{"type":"electronic","value":"9783540364139"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36413-7_7","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:44:57Z","timestamp":1184600697000},"page":"88-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Improved Pseudorandom Generator Based on Hardness of Factoring"],"prefix":"10.1007","author":[{"given":"Nenad","family":"Dedi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonid","family":"Reyzin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salil","family":"Vadhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,3,14]]},"reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"W. Alexi, B. Chor, O. Goldreich, and C. Schnorr. RSA and Rabin functions: Certain parts are as hard as the whole. SIAM Journal on Computing, 17(2):194\u2013209, April 1988.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"L. Blum, M. Blum, and M. Shub. A simple unpredictable pseudo-random number generator. SIAM Journal on Computing, 15(2):364\u2013383, May 1986.","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"7_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 Journal on Computing, 13(4):850\u2013863, November 1984.","journal-title":"SIAM Journal on Computing"},{"key":"7_CR4","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-CRYPTO 2000","author":"R. Gennaro","year":"2000","unstructured":"Rosario Gennaro. An improved pseudo-random generator based on discrete log. In Mihir Bellare, editor, Advances in Cryptology-CRYPTO 2000, volume 1880 of Lecture Notes in Computer Science, pages 469\u2013481. Springer-Verlag, 20-24 August 2000."},{"doi-asserted-by":"crossref","unstructured":"Oded Goldreich. Foundations of Cryptography: Basic Tools. Cambridge University Press, 2001.","key":"7_CR5","DOI":"10.1017\/CBO9780511546891"},{"unstructured":"Oded Goldreich and Vered Rosen. On the security of modular exponentiation with application to the construction of pseudorandom generators. Technical Report 2000\/064, Cryptology e-print archive, http:\/\/eprint.iacr.org, 2000. Prior version appears in [Ros01].","key":"7_CR6"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/0022-0000(93)90038-X","volume":"47","author":"J. H\u00e5stad","year":"1993","unstructured":"J. H\u00e5stad, A. W. Schrift, and A. Shamir. The discrete logarithm modulo a composite hides O(n) bits. Journal of Computer and System Sciences, 47:376\u2013404, 1993.","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR8","series-title":"Lect Notes Comput Sci","first-page":"95","volume-title":"Advances in Cryptology-CRYPTO\u2019 94","author":"C. Hoon Lim","year":"1994","unstructured":"Chae Hoon Lim and Pil Joong Lee. More flexible exponentiation with precomputation. In Yvo G. Desmedt, editor, Advances in Cryptology-CRYPTO\u2019 94, volume 839 of Lecture Notes in Computer Science, pages 95\u2013107. Springer-Verlag, 21\u201325 August 1994."},{"key":"7_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/BFb0055737","volume-title":"Advances in Cryptology-CRYPTO\u2019 98","author":"S. Patel","year":"1998","unstructured":"S. Patel and G. Sundaram. An efficient discrete log pseudo random generator. In Hugo Krawczyk, editor, Advances in Cryptology-CRYPTO\u2019 98, volume 1462 of Lecture Notes in Computer Science, pages 304\u2013317. Springer-Verlag, 23-27 August 1998."},{"unstructured":"Vered Rosen. On the security of modular exponentiation with application to the construction of pseudorandom generators. Technical Report TR01-007, ECCC (Electronic Colloquium on Computational Complexity, http:\/\/www.eccc.uni-trier.de\/eccc), 2001.","key":"7_CR10"},{"doi-asserted-by":"crossref","unstructured":"A. C. Yao. Theory and application of trapdoor functions. In 23rd Annual Symposium on Foundations of Computer Science, pages 80\u201391, Chicago, Illinois, 3\u20135 November 1982. IEEE.","key":"7_CR11","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Security in Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36413-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,6]],"date-time":"2021-01-06T05:07:06Z","timestamp":1609909626000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36413-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540004202","9783540364139"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-36413-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"14 March 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}