{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:15:08Z","timestamp":1725484508188},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429876"},{"type":"electronic","value":"9783540456827"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45682-1_26","type":"book-chapter","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T02:31:48Z","timestamp":1180146708000},"page":"442-459","source":"Crossref","is-referenced-by-count":5,"title":["Practical Construction and Analysis of Pseudo-Randomness Primitives"],"prefix":"10.1007","author":[{"given":"Johan","family":"H\u00e5stad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mats","family":"N\u00e4slund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,20]]},"reference":[{"issue":"4","key":"26_CR1","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 Journal on Computing, 13(4), 850\u2013864, 1984.","journal-title":"SIAM Journal on Computing"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"O. Goldreich: Modern Cryptography, Probabilistic Proofs and Pseudo-randomness. Springer-Verlag, 1999.","DOI":"10.1007\/978-3-662-12521-2"},{"issue":"4","key":"26_CR3","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser and S. Micali: How to Construct Random Functions. J. ACM, 33(4), 792\u2013807, 1986.","journal-title":"J. ACM"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"O. Goldreich and L. A. Levin: A Hard Core Predicate for any One Way Function. Proceedings, 21st ACM STOC, 1989, pp. 25\u201332.","DOI":"10.1145\/73007.73010"},{"issue":"2","key":"26_CR5","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. J. Comput. Syst. Sci., 28(2), 270\u2013299, 1984.","journal-title":"J. Comput. Syst. Sci."},{"key":"26_CR6","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. A. Levin, and M. Luby: Pseudo Random Number Generators from any One-way Function. SIAM Journal on Computing, 28, 1364\u20131396, 1999.","journal-title":"SIAM Journal on Computing"},{"key":"26_CR7","unstructured":"D. Knuth: Seminumerical algorithms, (2 ed.), Volume 2 of The art of computer programming, Addison-Wesley, 1982."},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02579323","volume":"7","author":"L. Levin","year":"1987","unstructured":"L. Levin: One-way Functions and Pseudorandom Generators. Combinatorica 7, 357\u2013363, 1987.","journal-title":"Combinatorica"},{"issue":"3","key":"26_CR9","first-page":"1102","volume":"58","author":"L. Levin","year":"1993","unstructured":"L. Levin: Randomness and Non-determinism. J. Symb. Logic, 58(3), 1102\u20131103, 1993.","journal-title":"J. Symb. Logic"},{"key":"26_CR10","unstructured":"F. J. MacWilliams and N. J. A. Sloane: The Theory of Error Correcting Codes. North-Holland, 1977."},{"key":"26_CR11","unstructured":"G. Marsaglia: The Diehard statistical Tests. http:\/\/stat.fsu.edu\/~geo\/diehard.html"},{"key":"26_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/3-540-49264-X_29","volume-title":"Universal Hash Functions & Hard-Core Bits","author":"M. N\u00e4slund","year":"1995","unstructured":"M. N\u00e4slund: Universal Hash Functions & Hard-Core Bits. Proceedings, Eurocrypt\u2019 95, LNCS 921, pp. 356\u2013366, Springer Verlag."},{"key":"26_CR13","unstructured":"J. Daemen and V. Rijmen: AES Proposal: Rijndael. http:\/\/www.nist.gov\/aes\/"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"U. V. Vazirani and V. V. Vazirani: Efficient and Secure Pseudo-Random Number Generation. Proceedings, 25th IEEE FOCS, 1984, pp. 458\u2013463.","DOI":"10.1109\/SFCS.1984.715948"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"A. C. Yao: Theory and Applications of Trapdoor Functions. Proceedings, 23rd IEEE FOCS, 1982, pp. 80\u201391.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 ASIACRYPT 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45682-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T06:47:45Z","timestamp":1556434065000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45682-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429876","9783540456827"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45682-1_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}