{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T06:40:22Z","timestamp":1737355222153,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540564133"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-47555-9_21","type":"book-chapter","created":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T23:23:49Z","timestamp":1186615429000},"page":"239-255","source":"Crossref","is-referenced-by-count":43,"title":["A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generators"],"prefix":"10.1007","author":[{"given":"Ueli M.","family":"Maurer","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"N. Alon, O. Goldreich, J. Hastad and R. Peralta, Simple constructions of almost k-wise independent random variables, Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, pp. 544\u2013553, 1990.","DOI":"10.1109\/FSCS.1990.89575"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1137\/0210008","volume":"10","author":"M. Blum","year":"1981","unstructured":"M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudo-random bits, SIAM Journal on Computing, Vol. 10, pp. 96\u2013113, 1981.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"21_CR3","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0885-064X(89)90015-0","volume":"5","author":"B. Chor","year":"1989","unstructured":"B. Chor and O. Goldreich, On the power of two-point based sampling, Journal of Complexity, Vol. 5, No. 1, pp. 96\u2013106, 1989.","journal-title":"Journal of Complexity"},{"key":"21_CR4","volume-title":"Cryptography and Data Security","author":"D.E. Denning","year":"1983","unstructured":"D.E. Denning, Cryptography and Data Security, Addison-Wesley, Reading, MA, 1983."},{"key":"21_CR5","doi-asserted-by":"crossref","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, Journal of the Association for Computing Machinery, Vol. 33, pp. 792\u2013807, 1986.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"1","key":"21_CR6","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1214\/aop\/1176996762","volume":"2","author":"A. Joffe","year":"1974","unstructured":"A. Joffe, On a set of almost deterministic k-independent random variables, The Annals of Probability, Vol. 2, No. 1, pp. 161\u2013162, 1974.","journal-title":"The Annals of Probability"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1214\/aoms\/1177700007","volume":"36","author":"H.O. Lancaster","year":"1965","unstructured":"H.O. Lancaster, Pairwise statistical independence, Ann. Math. Statist., Vol. 36, pp. 1313\u20131317, 1965.","journal-title":"Ann. Math. Statist."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"L.A. Levin, One-way functions and pseudorandom generators, Proc. 17th ACM Symposium on Theory of Computing, pp. 363\u2013364, 1985.","DOI":"10.1145\/22145.22185"},{"issue":"2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"M. Luby and C. Rackoff, How to construct pseudorandom permutations from pseudorandom functions, SIAM Journal on Computing, Vol. 17, No. 2, pp. 373\u2013386, 1988.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"21_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF00196773","volume":"4","author":"U.M. Maurer","year":"1991","unstructured":"U.M. Maurer and J.L. Massey, Local randomness in pseudo-random sequences, Journal of Cryptology, Vol. 4, No. 2, pp. 135\u2013149, 1991.","journal-title":"Journal of Cryptology"},{"key":"21_CR11","volume-title":"Etude des g\u00e9n\u00e9rateurs de permutations bas\u00e9s sur le Sch\u00e9ma du D.E.S.","author":"J. Patarin","year":"1991","unstructured":"J. Patarin, Etude des g\u00e9n\u00e9rateurs de permutations bas\u00e9s sur le Sch\u00e9ma du D.E.S., Ph. D. Thesis, INRIA, Domaine de Voluceau, Le Chesnay, France, 1991. An extract appeared in: J. Patarin, New results on pseudorandom permutation generators based on the DES scheme, Advances in Cryptology \u2014 CRYPTO\u201991, J. Feigenbaum (Ed.), Lecture Notes in Computer Science, Vol. 576, Springer-Verlag, pp. 301\u2013312, 1992."},{"key":"21_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/3-540-46877-3_12","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201990","author":"J. Pieprzyk","year":"1991","unstructured":"J. Pieprzyk, How to construct pseudorandom permutations from single pseudorandom functions, Advances in Cryptology \u2014 EUROCRYPT\u201990, I.B. Damg\u00e5rd (Ed.), Lecture Notes in Computer Science, Vol. 473, Springer-Verlag, pp. 140\u2013150, 1991."},{"key":"21_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/3-540-45961-8_19","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201988","author":"C.P. Schnorr","year":"1988","unstructured":"C.P. Schnorr, On the construction of random number generators and random function generators, Advances in Cryptology \u2014 EUROCRYPT\u201988, C.G. G\u00fcnther (Ed.), Lecture Notes in Computer Science, Vol. 330, Springer-Verlag, pp. 225\u2013232, 1988."},{"key":"21_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1007\/3-540-46885-4_41","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201989","author":"Y. Zheng","year":"1990","unstructured":"Y. Zheng, T. Matsumoto and H. Imai, Impossibility and optimality results on constructing pseudorandom permutations, Advances in Cryptology \u2014 EUROCRYPT\u201989, J.-J. Quisquater et al. (Eds.), Lecture Notes in Computer Science, Vol. 434, Springer-Verlag, pp. 412\u2013421, 1990."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT\u2019 92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47555-9_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T06:00:21Z","timestamp":1737352821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47555-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540564133"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-47555-9_21","relation":{},"subject":[]}}