{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T12:07:38Z","timestamp":1769515658057,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540648925","type":"print"},{"value":"9783540684626","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055737","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T21:12:36Z","timestamp":1154034756000},"page":"304-317","source":"Crossref","is-referenced-by-count":37,"title":["An efficient discrete log pseudo random generator"],"prefix":"10.1007","author":[{"given":"Sarvar","family":"Patel","sequence":"first","affiliation":[]},{"given":"Ganapathy S.","family":"Sundaram","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"W. Alexi, B. Chor, O. Goldreich and C. P. Schnorr, RSA\/Rabin bits are 1\/2+1\/poly(log N) secure, Proceedings of 25th FOCS, 449\u2013457, 1984.","DOI":"10.1109\/SFCS.1984.715947"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, B. Chor, A. Shamir, On the cryptographic security of single RSA bits, Proceedings of 15th STOC, 421\u2013430, 1983.","DOI":"10.1145\/800061.808773"},{"issue":"No.2","key":"22_CR3","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 secure pseudo-random number generator, SIAM J. Computing, 15 No. 2:364\u2013383, 1986.","journal-title":"SIAM J. Computing"},{"issue":"No.4","key":"22_CR4","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 No. 4:850\u2013864, 1984.","journal-title":"SIAM J. Computing"},{"key":"22_CR5","unstructured":"R. B. Boppana, and R. Hirschfeld, Pseudorrandom generators and complexity classes, Advances in Computing Research, 5 (S. Micali, Ed.), JAI Press, CT."},{"key":"22_CR6","unstructured":"U. S. Department of Commerce\/ N. I. S. T, Digital Signature Standard, FIPS 186, May 1994."},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"O. Goldreich, and L. A. Levin, A hard-core predicate for all one way functions, Proceedings of 21st STOC, 25\u201332, 1989.","DOI":"10.1145\/73007.73010"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser, and A. Micali, Probabilistic encryption, Journal of Computer and Systems Science, 28: 270\u2013299, 1984.","journal-title":"Journal of Computer and Systems Science"},{"key":"22_CR9","unstructured":"J. Hastad, R. Impagliazzo, L. A. Levin, and M. Luby, Construction of pseudo-random generator from any one-way function, SIAM J. Computing, to appear."},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/0022-0000(93)90038-X","volume":"47","author":"J. Hastad","year":"1993","unstructured":"J. Hastad, A. W. Schrift, and A. Shamir, The discrete logarithm modulo a composite modulus hides O(n) bits, Journal of Computer and System Sciences, 47: 376\u2013404, 1993.","journal-title":"Journal of Computer and System Sciences"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, L. A. Levin, and M. Luby, Pseudo-random generation from one-way functions, Proceddings of 20th STOC, 12\u201324, 1988.","DOI":"10.1145\/73007.73009"},{"key":"22_CR12","first-page":"84","volume":"263","author":"B. S. Kaliski","year":"1987","unstructured":"B. S. Kaliski, A pseudo-random bit generator based on elliptic logarithms, Advances in Cryptology \u2014 CRYPTO '86 (LNCS 263), 84\u2013103, 1987.","journal-title":"LNCS"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"J. Kilian, S. Micali, and R. Ostrovsky, Minimum resource zero-knowledge proofs, Procedings of 30th FOCS, 474\u2013489, 1989.","DOI":"10.1109\/SFCS.1989.63521"},{"key":"22_CR14","unstructured":"D. E. Knuth, The Art of Computer Programming (vol S): Sorting and Searching, Addison Wesley, 1973."},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"203","DOI":"10.2307\/2007884","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"N. Koblitz, Elliptic curve cryptosystems, Mathematics of Computation, 48:203\u2013209, 1987.","journal-title":"Mathematics of Computation"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1137\/0217021","volume":"17","author":"D. L. Long","year":"1988","unstructured":"D. L. Long, and A. Wigderson, The discrete log hides O(log n) bits, SIAM J. Computing, 17:363\u2013372, 1988.","journal-title":"SIAM J. Computing"},{"key":"22_CR17","first-page":"417","volume":"218","author":"V. Miller","year":"1986","unstructured":"V. Miller, Elliptic curves and cryptography, Advances in Cryptology \u2014 CRYPTO '85 (LNCS 218), 417\u2013426, 1986.","journal-title":"LNCS"},{"key":"22_CR18","first-page":"128","volume":"435","author":"M. Naor","year":"1989","unstructured":"M. Naor, Bit commitment using pseudo-randomness, Advances in Cryptology \u2014 CRYPTO '89 (LNCS 435), 128\u2013136, 1989.","journal-title":"LNCS"},{"key":"22_CR19","first-page":"332","volume":"1070","author":"P. Oorschot van","year":"1996","unstructured":"P. van Oorschot, M. Wiener, On Diffie-Hellman key agreement with short exponents, Advances in Cryptology \u2014 EUROCRYPT '96 (LNCS 1070), 332\u2013343, 1996.","journal-title":"LNCS"},{"key":"22_CR20","first-page":"62","volume":"219","author":"R. Peralta","year":"1986","unstructured":"R. Peralta, Simultaneous security of bits in the discrete log, Advances in Cryptology \u2014 EUROCRYPT '85 (LNCS 219), 62\u201372, 1986.","journal-title":"LNCS"},{"key":"22_CR21","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S. C. Pohlig","year":"1978","unstructured":"S. C. Pohlig, and M. E. Hellman, An improved algorithm for computing over GF(p) and its cryptographic significance, IEEE Trans. IT, 24: 106\u2013110, 1978.","journal-title":"IEEE Trans. IT"},{"issue":"No.143","key":"22_CR22","doi-asserted-by":"publisher","first-page":"918","DOI":"10.2307\/2006496","volume":"32","author":"J. M. Pollard","year":"1978","unstructured":"J. M. Pollard, Monte Carlo methods for index compution (mod p), Mathematics of Computation, 32, No. 143:918\u2013924, 1978.","journal-title":"Mathematics of Computation"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"U. V. Vazirani, and V. V. Vazirani, Efficient and secure pseudo-random number generators, Proceedings of 25th FOCS, 458\u2013463, 1984.","DOI":"10.1109\/SFCS.1984.715948"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"A. C. Yao, Theory and applications of trapdoor functions, Proceedings of 23rd FOCS, 80\u201391, 1982.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO '98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055737","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T03:51:25Z","timestamp":1736481085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055737"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648925","9783540684626"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/bfb0055737","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}