{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:04:20Z","timestamp":1775282660975,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540633846","type":"print"},{"value":"9783540695288","type":"electronic"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":[[1997]]},"DOI":"10.1007\/bfb0052242","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T14:37:31Z","timestamp":1155825451000},"page":"277-291","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":52,"title":["\u201cPseudo-random\u201d number generation within cryptographic algorithms: The DDS case"],"prefix":"10.1007","author":[{"given":"Mihir","family":"Bellare","sequence":"first","affiliation":[]},{"given":"Shafi","family":"Goldwasser","sequence":"additional","affiliation":[]},{"given":"Daniele","family":"Micciancio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,17]]},"reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L. Babai","year":"1986","unstructured":"L. Babai. On Lov\u00e1sz' lattice reduction and the nearest lattice point problem. Combinatorica, 6(1):1\u201313, 1986.","journal-title":"Combinatorica"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. Proceedings of the First Annual Conference on Computer and Communications Security, ACM, 1993.","DOI":"10.1145\/168588.168596"},{"issue":"4","key":"19_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 J. Computing, 13(4):850\u2013863, November 1984.","journal-title":"SIAM J. Computing"},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/58562.59305","volume":"36","author":"J. Boyar","year":"1989","unstructured":"Joan Boyar. Inferring sequences produced by pseudo-random number generators. Journal of the ACM, 36(1):129\u2013141, January 1989.","journal-title":"Journal of the ACM"},{"key":"19_CR5","first-page":"480","volume-title":"Linear congruential generators do not produce random sequences","author":"A. M. Frieze","year":"1984","unstructured":"A. M. Frieze, R. Kannan, and J. C. Lagarias. Linear congruential generators do not produce random sequences. In Proc. 25th IEEE Symp. on Foundations of Comp. Science, pages 480\u2013484, Singer Island, 1984. IEEE."},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Taher El Gamal. A public key cryptosystem and a signature scheme based on discrete logarithms. In G. R. Blakley and D. C. Chaum, editors, Proc. CRYPTO 84, pages 10\u201318. Springer, 1985. Lecture Notes in Computer Science No. 196.","DOI":"10.1007\/3-540-39568-7_2"},{"key":"19_CR7","first-page":"464","volume-title":"How to construct random functions","author":"O. Goldreich","year":"1984","unstructured":"O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. In Proc. 25th IEEE Symp. on Foundations of Comp. Science, pages 464\u2013479, Singer Island, 1984. IEEE."},{"key":"19_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 S. Micali. Probabilistic Encryption. Journal of Computer and System Sciences 28:270\u2013299, April 1984.","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR9","first-page":"356","volume-title":"The cryptographic security of truncated linearly related variables","author":"J. Hastad","year":"1985","unstructured":"J. Hastad and A. Shamir. The cryptographic security of truncated linearly related variables. In Proc. 17th ACM Symp. on Theory of Computing, pages 356\u2013362, Providence, 1985. ACM."},{"issue":"3","key":"19_CR10","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R. Kannan","year":"1987","unstructured":"R. Kannan. Minkowski's convex body theorem and integer programming. Mathematics of operations research, 12(3):415\u2013440, 1987.","journal-title":"Mathematics of operations research"},{"key":"19_CR11","unstructured":"Donald E. Knuth. Seminumerical Algorithms, volume 2 of The Art of Computer Programming. Addison-Wesley, 1969. Second edition, 1981."},{"issue":"1","key":"19_CR12","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1109\/TIT.1985.1056997","volume":"IT-31","author":"D. E. Knuth","year":"1985","unstructured":"Donald E. Knuth. Deciphering a linear congruential encryption. IEEE Transactions on Information Theory, IT-31(1):49\u201352, January 1985.","journal-title":"IEEE Transactions on Information Theory"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"H. Krawczyk. How to predict congruential generators. In G. Brassard, editor, Proc. CRYPTO 89, pages 138\u2013153. Springer, 1990. Lecture Notes in Computer Science No. 435.","DOI":"10.1007\/0-387-34805-0_14"},{"issue":"4","key":"19_CR14","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra","year":"1983","unstructured":"H.W. Lenstra. Integer programming with a fixed number of variables. Mathematics of operations research, 8(4):538\u2013548, 1983.","journal-title":"Mathematics of operations research"},{"key":"19_CR15","unstructured":"National Institute of Standards and Technology (NIST). FIPS Publication 180: Secure Hash Standard (SHS), May 11, 1993."},{"key":"19_CR16","unstructured":"National Institute of Standards and Technology (NIST). FIPS Publication 186: Digital Signature Standard, May 19, 1994."},{"key":"19_CR17","first-page":"153","volume-title":"Inferring a sequence generated by a linear congruence","author":"J. Plumstead (Boyar)","year":"1982","unstructured":"J. Plumstead (Boyar). Inferring a sequence generated by a linear congruence. In Proc. 23rd IEEE Symp. on Foundations of Comp. Science, pages 153\u2013159, Chicago, 1982. IEEE."},{"key":"19_CR18","unstructured":"Adi Shamir. The generation of cryptographically strong pseudo-random sequences. In Allen Gersho, editor, Advances in Cryptology: A Report on CRYPTO 81, pages 1\u20131. U.C. Santa Barbara Dept. of Elec. and Computer Eng., 1982. Tech Report 82-04."},{"key":"19_CR19","first-page":"421","volume-title":"Secret linear congruential generators are not cryptographically secure","author":"J. Stern","year":"1987","unstructured":"J. Stern. Secret linear congruential generators are not cryptographically secure. In Proc. 28th IEEE Symp. on Foundations of Comp. Science, pages 421\u2013426, Los Angeles, 1987. IEEE."},{"key":"19_CR20","first-page":"80","volume-title":"Theory and application of trapdoor functions","author":"A. C. Yao","year":"1982","unstructured":"A. C. Yao. Theory and application of trapdoor functions. In Proc. 23rd IEEE Symp. on Foundations of Comp. Science, pages 80\u201391, Chicago, 1982. IEEE."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO '97"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052242","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T22:26:49Z","timestamp":1580336809000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052242"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633846","9783540695288"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0052242","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"17 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}