{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:34:17Z","timestamp":1762004057579,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662266"},{"type":"electronic","value":"9783540485193"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48519-8_21","type":"book-chapter","created":{"date-parts":[[2007,10,24]],"date-time":"2007-10-24T21:34:55Z","timestamp":1193261695000},"page":"290-304","source":"Crossref","is-referenced-by-count":6,"title":["High-Speed Pseudorandom Number Generation with Small Memory"],"prefix":"10.1007","author":[{"given":"William","family":"Aiello","sequence":"first","affiliation":[]},{"given":"S.","family":"Rajagopalan","sequence":"additional","affiliation":[]},{"given":"Ramarathnam","family":"Venkatesan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,5,18]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1006\/jagm.1998.0952","volume":"29","author":"W. Aiello","year":"1998","unstructured":"W. Aiello, S. Rajagopalan, R. Venkatesan. \u201cDesign of Practical and Provably Good Random Number Generators,\u201d J. Algorithms 29, (1998) 358\u2013389. Appeared previously in 5th Annual ACM-SIAM Symp. Disc. Alg. (1995) 1\u20138.","journal-title":"J. Algorithms"},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02579166","volume":"6","author":"N. Alon","year":"1986","unstructured":"N. Alon, \u201cEigenvalues and expanders,\u201d Combinatorica 6 (1986) 83\u201396.","journal-title":"Combinatorica"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare, R. Canetti, H. Krawczyk, \u201cKeying Hash Functions for Message Authentication,\u201d Proceedings of Crypto\u2019 96, 1\u201315.","DOI":"10.1007\/3-540-68697-5_1"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"M. Bellare, R. Canetti, H. Krawczyk, \u201cPseudorandom functions revisited: The Cascade Construction and its Concrete Security,\u201d Proceedings of the 37th Symposium on Foundations of Computer Science, 1996.","DOI":"10.1109\/SFCS.1996.548510"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum, S. Micali, \u201cHow to Generate Cryptographically Strong Sequences of Pseudorandom Bits,\u201d Proceedings of FOCS (1982); SIAM J. Computing, 13 (1984) 850\u2013864.","journal-title":"SIAM J. Computing"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"B. den Boer, A. Bosselaers, \u201cCollisions for the compression function of MD5,\u201d Proceedings of Eurocrypt\u2019 93, 293\u2013304, 1994.","DOI":"10.1007\/3-540-48285-7_26"},{"key":"21_CR7","unstructured":"H. Dobbertin, \u201cThe Status of MD5 After a Recent Attack,\u201d CryptoBytes v2 No.2 (Summer 1996)."},{"key":"21_CR8","unstructured":"J.-B. Fischer, J. Stern, \u201cAn efficient pseudorandom generator provably as secure as syndrome decoding,\u201d in Proceedings of EUROCRYPT96 (1996) 245\u2013255."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"O. Gabber, Z. Galil, \u201cExplicit constructions of linear-sized superconcentrators,\u201d J. Comput. Sys. Sci. 22 (1981).","DOI":"10.1016\/0022-0000(81)90040-4"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"D. Gillman, \u201cA Chernoff bound for random walks in expander graphs,\u201d Proceedings of FOCS (1993).","DOI":"10.1109\/SFCS.1993.366819"},{"key":"21_CR11","unstructured":"O. Goldreich, S. Goldwasser, and S. Micali, \u201cOn the cryptographic applications of random functions,\u201d in Proceedings of CRYPTO 84 (1984) 276\u2013288."},{"key":"21_CR12","first-page":"1102","volume":"58","author":"O. Goldreich","year":"1993","unstructured":"O. Goldreich, L.A. Levin, \u201cHard Core Bit For Any One Way Function,\u201d Proceedings of STOC (1990); J. Symbolic Logic 58 (1993) 1102\u20131103.","journal-title":"J. Symbolic Logic"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"J. Hastad, R. Impagliazzo, L.A. Levin, M. Luby, \u201cPseudorandom Generation From One-Way Functions, Proceedings of STOC (1989) 12\u201324; \u201cPseudorandom Generators under Uniform assumptions,\u201d Proceedings of STOC (1990) 395\u2013404.","DOI":"10.1145\/73007.73009"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"M. Luby, \u201cPseudorandomness and its Cryptographic applications\u201d Princeton Univ Press, 1996.","DOI":"10.1515\/9780691206844"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"M. Naor, O. Reingold, \u201cSynthesizers and their application to the parallel construction of Pseudorandom Functions,\u201d Proceedings of FOCS, (1995) 170\u2013181.","DOI":"10.1109\/SFCS.1995.492474"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"M. Naor, O. Reingold, \u201cNumber-Theoretic Constructions of Efficient Pseudorandom Functions,\u201d Proceedings of FOCS, (1997) 458\u2013467.","DOI":"10.1109\/SFCS.1997.646134"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"M. Naor, O. Reingold, \u201cFrom Unpredictability to Indistinguishability: A simple construction of Pseudorandom Functions from MACs,\u201d Proceedings of Crypto\u201998, 267\u2013282.","DOI":"10.1007\/BFb0055734"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"P. van Oorschot, M. Wiener, \u201cParallel collision search with application to hash functions and discrete logarithms,\u201d in Proceedings of 2nd ACM Conference on Computer and Communication Security, 1994.","DOI":"10.1145\/191177.191231"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"J. Patarin, \u201cNew Results on Pseudorandom Permutation Generators Based on the DES Scheme,\u201d Proceedings of Crypto\u201991, (1991) 301\u2013312.","DOI":"10.1007\/3-540-46766-1_25"},{"key":"21_CR20","unstructured":"M. J. B. Robshaw, \u201cOn Recent Results for MD2, MD4 and MD5,\u201d RSA Laboratories Bulletin No. 4 (November 12, 1996)."},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"B. Schneier, D. Whiting, \u201cFast Software Encryption: Designing Encryption Algorithms for Optimal Software Speed on the Intel Pentium Processor,\u201d Fast Software Encryption Workshop (1997) 242\u2013259.","DOI":"10.1007\/BFb0052351"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"A.C. Yao, \u201cTheory and Applications of Trapdoor Functions,\u201d Proceedings of FOCS (1982) 80\u201391.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Fast Software Encryption"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48519-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T21:40:31Z","timestamp":1737495631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48519-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662266","9783540485193"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-48519-8_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}