{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:35:59Z","timestamp":1753886159455,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540180470"},{"type":"electronic","value":"9783540477211"}],"license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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":[[1987]]},"DOI":"10.1007\/3-540-47721-7_7","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T10:32:57Z","timestamp":1175769177000},"page":"84-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["A Pseudo-Random Bit Generator Based on Elliptic Logarithms"],"prefix":"10.1007","author":[{"suffix":"Jr.","given":"Burton S.","family":"Kaliski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,12,1]]},"reference":[{"key":"7_CR1","unstructured":"Werner Alexi, Benny Chor, Oded Goldreich, and Claus P. Schnorr. RSA and Rabin functions: Certain parts are as hard as the whole. To appear, SIAM Journal of Computing."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Leonard Adleman. A subexponential algorithm for the discrete logarithm problem with applications to cryptography. In Proceedings of the 20th Annual Symposium on Foundations of Computer Science, pages 55\u201360, IEEE Computer Society, 1979.","DOI":"10.1109\/SFCS.1979.2"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Miklos Ajtai and Avi Wigderson. Deterministic simulation of probabilistic constant depth circuits. In Proceedings of the 26th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, 1985.","DOI":"10.1109\/SFCS.1985.19"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Eric Bach. How to generate factored random numbers. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pages 184\u2013188. Association for Computing Machinery, 1983.","DOI":"10.1145\/800061.808747"},{"key":"7_CR5","unstructured":"Eric Bach. Lenstra\u2019s algorithm for factoring with elliptic curves, an expos\u00e9. 1985. Unpublished manuscript."},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Lenore Blum. Manuel Blum, and Michael Shub. Comparison of two pseudo-random number generators. In Proceedings of Crypto\u201982, pages 61\u201378. Plenum Press, 1983.","DOI":"10.1007\/978-1-4757-0602-4_6"},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Manuel Blum and Silvio Micali. How to generate cryptographically strong sequences of pseudorandom bits. SIAM Journal of Computing, 13(4):850\u2013864, 1984.","journal-title":"SIAM Journal of Computing"},{"issue":"131","key":"7_CR8","doi-asserted-by":"publisher","first-page":"951","DOI":"10.2307\/2005310","volume":"29","author":"I. Borosh","year":"1975","unstructured":"I. Borosh, C.J. Moreno, and H. Porta. Elliptic curves over finite fields: II. Mathematics of Computation. 29(131):951\u2013964. July 1975.","journal-title":"Mathematics of Computation"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1112\/jlms\/s1-41.1.193","volume":"41","author":"J.W.S. Cassels","year":"1966","unstructured":"J.W.S. Cassels. Diophantine equations with special reference to elliptic curves. Journal of the London Mathematical Society, 41:193\u2013291, 1966.","journal-title":"Journal of the London Mathematical Society"},{"key":"7_CR10","unstructured":"S. Chowla. The Riemann Hypothesis and Hilbert\u2019s Tenth Problem. Gordon and Breach, 1965."},{"issue":"6","key":"7_CR11","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"Whitefield Diffie and Martin E. Hellman. New directions in cryptography. IEEE Transactions in Information Theory, IT-22(6):644\u2013654, November 1976.","journal-title":"IEEE Transactions in Information Theory"},{"key":"7_CR12","unstructured":"Alvin W. Drake. Fundamentals of Applied Probability Theory. McGraw-Hill, Inc., 1967."},{"key":"7_CR13","unstructured":"William Fulton. Algebraic Curves. W.A. Benjamin, 1969."},{"key":"7_CR14","unstructured":"Oded Goldreich, Shafi Goldwasser, and Silvio Micali. How to construct random functions. In Proceedings of the 25th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, 1984."},{"key":"7_CR15","unstructured":"Shafi Goldwasser and Joseph Kilian. A provably correct, probably fast primality testing algorithm. 1986. To appear, Proceedings of the 18th Annual ACM Symposium on Theory of Computing."},{"key":"7_CR16","first-page":"74","volume":"59","author":"J.-R. Joly","year":"1973","unstructured":"Jean-Ren\u00e9 Joly. Equations et variet\u00e9s alg\u00e9briques sur un corps fini. L\u2019Enseignment Math\u00e9matique, 59:74\u201379, 1973.","journal-title":"L\u2019Enseignment Math\u00e9matique"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Neal Koblitz. Introduction to Elliptic Curves and Modular Forms. Volume 97 of Graduate Texts in Mathematics, Springer-Verlag, 1984.","DOI":"10.1007\/978-1-4684-0255-1"},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(76)90050-5","volume":"3","author":"D. E. Knuth","year":"1976","unstructured":"Donald E. Knuth and Luis Trabb-Pardo. Analysis of a simple factorization algorithm. Theoretical Computer Science, 3:321\u2013348, 1976.","journal-title":"Theoretical Computer Science"},{"key":"7_CR19","unstructured":"H.W. Lenstra. Elliptic curve factorization. Memorandum, 1985."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Leonid Levin. One-way functions and pseudorandom generators. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pages 363\u2013365, Association for Computing Machinery, 1985.","DOI":"10.1145\/22145.22185"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Douglas L. Long and Avi Wigderson. How discreet is the discrete log? In Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pages 413\u2013420, Association for Computing Machinery, 1983.","DOI":"10.1145\/800061.808772"},{"key":"7_CR22","unstructured":"Victor Miller. Elliptic curves and cryptography. 1985. To appear, Proceedings of Crypto\u201985."},{"key":"7_CR23","unstructured":"Victor Miller. Short programs for functions on curves. 1985. Unpublished manuscript."},{"key":"7_CR24","unstructured":"Carl Pomerance. How to factor a number. Seminar, MIT Laboratory for Computer Science, 1985."},{"key":"7_CR25","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1215\/ijm\/1255631807","volume":"6","author":"J. Rosser","year":"1962","unstructured":"J. Rosser and L. Schoenfield. Approximate formulas for some functions of prime numbers. Illinois Journal of Mathematics, 6:64\u201394, 1962.","journal-title":"Illinois Journal of Mathematics"},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"483","DOI":"10.2307\/2007968","volume":"44","author":"R. Schoof","year":"1985","unstructured":"Ren\u00e9 Schoof. Elliptic curves over finite fields and the computation of square roots mod p. Mathematics of Computation, 44:483\u2013494, April 1985.","journal-title":"Mathematics of Computation"},{"key":"7_CR27","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1137\/0206006","volume":"6","author":"R. Solovay","year":"1977","unstructured":"R. Solovay and V. Strassen. A fast Monte-Carlo test for primality. SIAM Journal of Computing, 6:84\u201385, 1977.","journal-title":"SIAM Journal of Computing"},{"key":"7_CR28","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF01389745","volume":"23","author":"J. T. Tate","year":"1974","unstructured":"John T. Tate. The arithmetic of elliptic curves. Inventiones Mathematicae, 23:179\u2013206, 1974.","journal-title":"Inventiones Mathematicae"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Andrew C. Yao. Theory and applications of trapdoor functions. In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, pages 80\u201391, IEEE Computer Society, 1982.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 86"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47721-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T14:27:31Z","timestamp":1736951251000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47721-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540180470","9783540477211"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-47721-7_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1987]]},"assertion":[{"value":"1 December 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}