{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T07:19:36Z","timestamp":1776842376281,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540679073","type":"print"},{"value":"9783540445982","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44598-6_29","type":"book-chapter","created":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T10:15:21Z","timestamp":1178014521000},"page":"469-481","source":"Crossref","is-referenced-by-count":28,"title":["An Improved Pseudo-random Generator Based on Discrete Log"],"prefix":"10.1007","author":[{"given":"Rosario","family":"Gennaro","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,8,11]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"L. Adleman. A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography. IEEE FOCS, pp. 55\u201360, 1979.","DOI":"10.1109\/SFCS.1979.2"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"W. Alexi, B. Chor, O. Goldreich and C. Schnorr. RSA and Rabin Functions: Certain Parts are as Hard as the Whole. SIAM J. Computing, 17(2):194\u2013209, April 1988.","DOI":"10.1137\/0217013"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"L. Blum, M. Blum and M. Shub. A Simple Unpredictable Pseudo-Random Number Generator. SIAM J.Computing, 15(2):364\u2013383, May 1986.","DOI":"10.1137\/0215025"},{"key":"29_CR4","doi-asserted-by":"crossref","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.","DOI":"10.1137\/0213053"},{"key":"29_CR5","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"-22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie and M. Hellman. New Directions in Cryptography. IEEE Trans. Inf. Theory, IT-22:644\u2013654, November 1976.","journal-title":"IEEE Trans. Inf. Theory, IT"},{"issue":"2","key":"29_CR6","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s001459910008","volume":"13","author":"R. Fischlin","year":"2000","unstructured":"R. Fischlin and C. Schnorr. Stronger Security Proofs for RSA and Rabin Bits. J.Crypt., 13(2):221\u2013244, Spring 2000.","journal-title":"J.Crypt."},{"key":"29_CR7","first-page":"270","volume":"28","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser and S. Micali. Probabilistic Encryption. JCSS, 28:270\u2013299, 1988.","journal-title":"JCSS"},{"issue":"4","key":"29_CR8","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"J. H\u00e5stad, R. Impagliazzo, L. Levin and M. Luby. A Pseudo-Random Generator from any One-Way Function. SIAM J.Computing, 28(4):1364\u20131396, 1999.","journal-title":"SIAM J.Computing"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad and M. N\u00e4slund. The Security of Individual RSA Bits. IEEE FOCS, pp. 510\u2013519, 1998.","DOI":"10.1109\/SFCS.1998.743502"},{"key":"29_CR10","first-page":"376","volume":"47","author":"J. H\u00e5stad","year":"1993","unstructured":"J. H\u00e5stad, A. Schrift and A. Shamir. The Discrete Logarithm Modulo a Composite Hides O(n) Bits. JCSS, 47:376\u2013404, 1993.","journal-title":"JCSS"},{"issue":"4","key":"29_CR11","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s001459900012","volume":"9","author":"R. Impagliazzo","year":"1996","unstructured":"R. Impagliazzo and M. Naor. Efficient Cryptographic Schemes Provably as Secure as Subset Sum. J.Crypt., 9(4):199\u2013216, 1996.","journal-title":"J.Crypt."},{"key":"29_CR12","unstructured":"D. Knuth. The Art of Computer Programming (vol.3): Sorting and Searching. Addison-Wesley, 1973."},{"key":"29_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/3-540-48658-5_11","volume-title":"CRYPTO\u201994","author":"C.H. Lim","year":"1994","unstructured":"C.H. Lim and P.J. Lee. More Flexible Exponentiation with Precomputation. CRYPTO\u201994, LNCS 839, pp. 95\u2013107."},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1137\/0217021","volume":"17","author":"D. Long","year":"1988","unstructured":"D. Long and A. Wigderson. The Discrete Log Hides O(logn) Bits. SIAM J.Computing, 17:363\u2013372, 1988.","journal-title":"SIAM J.Computing"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"M. Naor and O. Reingold. Number-Theoretic Constructions of Efficient Pseudo-Random Functions. IEEE FOCS, pp. 458\u2013467, 1997.","DOI":"10.1109\/SFCS.1997.646134"},{"key":"29_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1007\/BFb0055737","volume-title":"CRYPTO\u201998","author":"S. Patel","year":"1998","unstructured":"S. Patel and G. Sundaram. An Efficient Discrete Log Pseudo Random Generator. CRYPTO\u201998, LNCS 1462, pp. 304\u2013317, 1998."},{"key":"29_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-39805-8_8","volume-title":"EUROCRYPT\u201985","author":"R. Peralta","year":"1986","unstructured":"R. Peralta. Simultaneous Security of Bits in the Discrete Log. EUROCRYPT\u201985, LNCS 219, pp. 62\u201372, 1986."},{"issue":"143","key":"29_CR18","doi-asserted-by":"publisher","first-page":"918","DOI":"10.2307\/2006496","volume":"32","author":"J. Pollard","year":"1978","unstructured":"J. Pollard. Monte-Carlo Methods for Index Computation (mod p). Mathematics of Computation, 32(143):918\u2013924, 1978.","journal-title":"Mathematics of Computation"},{"key":"29_CR19","unstructured":"C. Schnorr Security of Allmost ALL Discrete Log Bits. Electronic Colloquium on Computational Complexity. Report TR98-033. Available at \n                    http:\/\/www.eccc.uni-trier.de\/eccc\/\n                    \n                  ."},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"A. Yao. Theory and Applications of Trapdoor Functions. IEEE FOCS, 1982.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44598-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T12:25:40Z","timestamp":1550319940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44598-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679073","9783540445982"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44598-6_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}