{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:28:27Z","timestamp":1725488907629},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425212"},{"type":"electronic","value":"9783540447092"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44709-1_9","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T14:04:18Z","timestamp":1186841058000},"page":"93-102","source":"Crossref","is-referenced-by-count":2,"title":["Pseudo-random Number Generation on the IBM 4758 Secure Crypto Coprocessor"],"prefix":"10.1007","author":[{"given":"Nick","family":"Howgrave-Graham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joan","family":"Dyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rosario","family":"Gennaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"key":"9_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":"9_CR2","doi-asserted-by":"crossref","unstructured":"L. Blum and 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":"9_CR3","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":"9_CR4","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"},{"key":"9_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/3-540-44598-6_29","volume-title":"CRYPTO\u2019","author":"R. Gennaro","year":"2000","unstructured":"R. Gennaro. An Improved Pseudo-random Generator Based on Discrete Log. CRYPTO\u20192000, LNCS 1880, pp. 469\u2013481, 2000. Updated version available at http:\/\/www.research.ibm.com\/people\/r\/rosario\/prng.ps"},{"key":"9_CR6","unstructured":"D. Knuth. The Art of Computer Programming (vol.3): Sorting and Searching. Addison-Wesley, 1973."},{"key":"9_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/3-540-48658-5_11","volume-title":"CRYPTO\u2019 94","author":"C.H. Lim","year":"1994","unstructured":"C.H. Lim and P.J. Lee. More Flexible Exponentiation with Precomputation. CRYPTO\u2019 94, LNCS 839, pp. 95\u2013107."},{"key":"9_CR8","unstructured":"National Institute of Standards and Technology. FIPS 140-1, Security Requirements for Cryptographic Modules. Available at http:\/\/csrc.nist.gov\/cryptval\/140-1.htm"},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"IT-24","author":"S.C. Pohlig","year":"1978","unstructured":"S.C. Pohlig and M.E. Hellman. An Improved Algorithm for Computing Logarithms over GF(p) and its Cryptographic Significance. IEEE Trans. Inf. Theory, vol. IT-24, no. 1, p. 106\u2013110, January 1978","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"143","key":"9_CR10","first-page":"918","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":"9_CR11","unstructured":"C. Schnorr Security of Allmost ALL Discrete Log Bits. Electronic Colloquium on Computational Complexity. Report TR98-033. Available at http:\/\/www.eccc.uni-trier.de\/eccc\/ ."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"S. Smith and S. Weingart. Building a High-Performance, Programmable Secure Coprocessor. Special Issue on Computer Network Security, Elsevier, 1990, v. 31, pp 831\u2013860. Also, IBM Research Report RC21102, February 1998.","DOI":"10.1016\/S1389-1286(98)00019-X"},{"key":"9_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/3-540-68339-9_29","volume-title":"EUROCRYPT\u201996","author":"P.C. Oorschot van","year":"1996","unstructured":"P.C. van Oorschot and M. Wiener. On Diffie-Hellman Key Agreement with Short Exponents. EUROCRYPT\u201996, LNCS 1070, pp. 332\u2013343, 1996."},{"key":"9_CR14","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","Cryptographic Hardware and Embedded Systems \u2014 CHES 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44709-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:25:14Z","timestamp":1556753114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44709-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425212","9783540447092"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44709-1_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}