{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T00:40:10Z","timestamp":1737420010055,"version":"3.33.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,9,15]],"date-time":"2007-09-15T00:00:00Z","timestamp":1189814400000},"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":["J Cryptol"],"published-print":{"date-parts":[[2008,1]]},"DOI":"10.1007\/s00145-007-9009-3","type":"journal-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T19:02:37Z","timestamp":1189796557000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Practical Construction and Analysis of\u00a0Pseudo-Randomness Primitives"],"prefix":"10.1007","volume":"21","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":[[2007,9,15]]},"reference":[{"issue":"2","key":"9009_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"W. Alexi, B. Chor, O. Goldreich, C.P. Schnorr, RSA and Rabin functions: Certain parts are as hard as the whole, SIAM J. Comput. 17(2), 194\u2013209 (1988)","journal-title":"SIAM J. Comput."},{"key":"9009_CR2","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"N. Alon, J. Spencer, The Probabilistic Method, 2nd edn. (Wiley, New York, 2000)","edition":"2"},{"doi-asserted-by":"crossref","unstructured":"M. Bellare, A. Desai, E. Jokipii, P. Rogaway, A concrete security treatment of symmetric encryption: analysis of the DES modes of operation, in Proceedings of the 38th IEEE Conference on Foundations of Computer Science, 1997, pp. 394\u2013403","key":"9009_CR3","DOI":"10.1109\/SFCS.1997.646128"},{"key":"9009_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44448-3_1","volume-title":"Advances in Cryptology-ASIACRYPT 2000","author":"A. Biryukov","year":"2000","unstructured":"A. Biryukov, A. Shamir, Cryptanalytic time\/memory\/data tradeoffs for stream ciphers, in Advances in Cryptology-ASIACRYPT 2000. Lecture Notes in Computer Science, vol.\u00a01976 (Springer, Berlin, 2000), pp. 1\u201313"},{"issue":"4","key":"9009_CR5","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum, S. Micali, How to generate cryptographically strong sequences of pseudo-random bits, SIAM J. Comput. 13(4), 850\u2013864 (1984)","journal-title":"SIAM J. Comput."},{"unstructured":"J. Daemen, V. Rijmen, AES proposal: Rijndael, www.nist.gov\/aes\/","key":"9009_CR6"},{"doi-asserted-by":"crossref","unstructured":"D. Eastlake, S. Crocker, J. Schiller, Randomness recommendations for security, RFC 1750, IETF, 1994","key":"9009_CR7","DOI":"10.17487\/rfc1750"},{"key":"9009_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-12521-2","volume-title":"Modern Cryptography, Probabilistic Proofs and Pseudo-Randomness","author":"O. Goldreich","year":"1999","unstructured":"O. Goldreich, Modern Cryptography, Probabilistic Proofs and Pseudo-Randomness (Springer, Berlin, 1999)"},{"issue":"4","key":"9009_CR9","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser, S. Micali, How to construct random functions, J. Assoc. Comput. Mach. 33(4), 792\u2013807 (1986)","journal-title":"J. Assoc. Comput. Mach."},{"doi-asserted-by":"crossref","unstructured":"O. Goldreich, L.A. Levin, A hard core predicate for any one way function, in Proceedings of 21st ACM Symposium on Theory of Computing, 1989, pp. 25\u201332","key":"9009_CR10","DOI":"10.1145\/73007.73010"},{"key":"9009_CR11","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"G. Hast","year":"1999","unstructured":"G. Hast, Nearly one-sided tests and the Goldreich\u2013Levin predicate, SIAM J. Comput. 28, 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"9009_CR12","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, M. Luby, Pseudo-random number generators from any one-way function, SIAM J. Comput. 28, 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"9009_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/3-540-45682-1_26","volume-title":"Advances in Cryptology\u2014Asiacrypt 2001","author":"J. H\u00e5stad","year":"2001","unstructured":"J. H\u00e5stad, M. N\u00e4slund, Practical construction and analysis of pseudo-randomness primitives, in Advances in Cryptology\u2014Asiacrypt 2001, ed. by C.\u00a0Boyd. Lecture Notes in Computer Science, vol.\u00a02248 (Springer, Berlin, 2001), pp. 442\u2013459"},{"unstructured":"J. H\u00e5stad, M. N\u00e4slund, BMGL: Synchronous key-stream generator with provable security, in Proceedings of the 1st Open NESSIE Workshop, 13\u201314 November 2000","key":"9009_CR14"},{"unstructured":"J. H\u00e5stad, M. N\u00e4slund, Improved analysis of the BMGL key-stream generator, in Proceedings of the 2nd Open NESSIE Workshop, 12\u201313 September 2001","key":"9009_CR15"},{"key":"9009_CR16","series-title":"The Art of Computer Programming","volume-title":"Seminumerical Algorithms","author":"D. Knuth","year":"1982","unstructured":"D. Knuth, Seminumerical Algorithms, 2nd edn. The Art of Computer Programming, vol.\u00a02 (Addison-Wesley, Reading, 1982)","edition":"2"},{"key":"9009_CR17","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 pseudo-random generators, Combinatorica 7, 357\u2013363 (1987)","journal-title":"Combinatorica"},{"issue":"3","key":"9009_CR18","first-page":"1102","volume":"58","author":"L. Levin","year":"1993","unstructured":"L. Levin, Randomness and non-determinism, J. Symb. Log. 58(3), 1102\u20131103 (1993)","journal-title":"J. Symb. Log."},{"key":"9009_CR19","volume-title":"The Theory of Error Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"F.J. MacWilliams, N.J.A. Sloane, The Theory of Error Correcting Codes (North-Holland, Amsterdam, 1977)"},{"unstructured":"G. Marsaglia, The Diehard statistical tests, http:\/\/stat.fsu.edu\/~geo\/diehard.html","key":"9009_CR20"},{"key":"9009_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/3-540-49264-X_29","volume-title":"Proceedings of Advances in Cryptology\u2014Eurocrypt 1995","author":"M. N\u00e4slund","year":"1995","unstructured":"M. N\u00e4slund, Universal hash functions & hard-core bits, in Proceedings of Advances in Cryptology\u2014Eurocrypt 1995. Lecture Notes in Computer Science, vol.\u00a0921 (Springer, Berlin, 1995), pp. 356\u2013366"},{"unstructured":"S. Pyka, The statistical evaluation of the NESSIE submission BMGL, NESSIE Public report NES\/DOC\/SAG\/WP3\/039\/1, 2001","key":"9009_CR22"},{"issue":"4","key":"9009_CR23","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s001459900048","volume":"11","author":"P. Rogaway","year":"1988","unstructured":"P. Rogaway, D. Coppersmith, A software-optimized encryption algorithm, J. Cryptol. 11(4), 273\u2013287 (1988)","journal-title":"J. Cryptol."},{"key":"9009_CR24","volume-title":"Applied Cryptography","author":"B. Schneier","year":"1995","unstructured":"B. Schneier, Applied Cryptography (Wiley, New York, 1995)"},{"doi-asserted-by":"crossref","unstructured":"U.V. Vazirani, V.V. Vazirani, Efficient and secure pseudo-random number generation, in Proceedings of 25th IEEE Symposium on Foundations of Computer Science, 1984, pp. 458\u2013463","key":"9009_CR25","DOI":"10.1109\/SFCS.1984.715948"},{"doi-asserted-by":"crossref","unstructured":"A.C. Yao, Theory and applications of trapdoor functions, in Proceedings of 23rd IEEE Symposium on Foundations of Computer Science, 1982, pp. 80\u201391","key":"9009_CR26","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-007-9009-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-007-9009-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-007-9009-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-007-9009-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T00:19:25Z","timestamp":1737418765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-007-9009-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,15]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["9009"],"URL":"https:\/\/doi.org\/10.1007\/s00145-007-9009-3","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[2007,9,15]]},"assertion":[{"value":"18 June 2003","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2007","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2007","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}