{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T07:29:36Z","timestamp":1753601376034},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540006220"},{"type":"electronic","value":"9783540364924"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":[[2003]]},"DOI":"10.1007\/3-540-36492-7_18","type":"book-chapter","created":{"date-parts":[[2007,10,23]],"date-time":"2007-10-23T23:36:10Z","timestamp":1193182570000},"page":"271-290","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Luby-Racko. Ciphers: Why XOR Is Not So Exclusive"],"prefix":"10.1007","author":[{"given":"Sarvar","family":"Patel","sequence":"first","affiliation":[]},{"given":"Zulfikar","family":"Ramzan","sequence":"additional","affiliation":[]},{"given":"Ganpathy S.","family":"Sundaram","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,17]]},"reference":[{"key":"18_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/3-540-48658-5_32","volume-title":"Advances in Cryptology-CRYPTO\u2019 94","author":"M. Bellare","year":"1994","unstructured":"M. Bellare, J. Kilian, and P. Rogaway. The security of cipher block chaining. In Yvo G. Desmedt, editor, Advances in Cryptology-CRYPTO\u2019 94, volume 839 of Lecture Notes in Computer Science, pages 341\u2013358. Springer-Verlag, 21-25 August 1994."},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1090\/S0025-5718-1970-0276200-X","volume":"24","author":"E. R. Berlekamp","year":"1970","unstructured":"E. R. Berlekamp. Factoring polynomials over large finite fields. Mathematics of Computation, 24:713\u2013735, 1970.","journal-title":"Mathematics of Computation"},{"key":"18_CR3","unstructured":"E. Biham and A. Shamir. Differential Cryptanalysis of the Data Encryption Standard. Springer Verlag, 1993. ISBN: 0-387-97930-1, 3-540-97930."},{"key":"18_CR4","unstructured":"G. Carter, E. Dawson, and L. Nielsen. DESV: A Latin Square variation of DES. In Proceeding of Workshop on Selected Areas of Cryptography, 1995."},{"key":"18_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Square hash: Fast message authentication via optimized universal hash functions","author":"M. Etzel","year":"1999","unstructured":"M. Etzel, S. Patel, and Z. Ramzan. Square hash: Fast message authentication via optimized universal hash functions. In Proc. CRYPTO 99, Lecture Notes in Computer Science. Springer-Verlag, 1999."},{"key":"18_CR6","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979."},{"issue":"4","key":"18_CR7","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. Journal of the ACM, 33(4):792\u2013807, October 1986.","journal-title":"Journal of the ACM"},{"key":"18_CR8","unstructured":"I. N. Herstein. Topics in Algebra. Blaisdell Publishing Company, 1964."},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"Richard M. Karp","year":"1972","unstructured":"R. Karp. Reducibility among combinatorial problems. in Complexity of Computer Computations, 1972."},{"issue":"2","key":"18_CR10","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"M. Luby and C. Racko.. How to construct pseudorandom permutations and pseudorandom functions. SIAM J. Computing, 17(2):373\u2013386, April 1988.","journal-title":"SIAM J. Computing"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/PL00003817","volume":"12","author":"M. Naor","year":"1999","unstructured":"M. Naor and O. Reingold. On the construction of pseudo-random permutations: Luby-Racko. revisited. J. of Cryptology, 12:29\u201366, 1999. Preliminary version in:Proc. STOC 97.","journal-title":"revisited. J. of Cryptology"},{"key":"18_CR12","series-title":"Lect Notes Comput Sci","volume-title":"New results on pseudorandom permutation generators based on the DES scheme","author":"J. Patarin","year":"1991","unstructured":"J. Patarin. New results on pseudorandom permutation generators based on the DES scheme. In Proc. CRYPTO 91, Lecture Notes in Computer Science. Springer-Verlag, 1991."},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"J. Patarin. Improved security bounds for pseudorandom permutations. In 4th ACM Conference on Computer and Communications Security, pages 140\u2013150, 1997.","DOI":"10.1145\/266420.266452"},{"key":"18_CR14","series-title":"Lect Notes Comput Sci","volume-title":"ciphers optimal and practical","author":"S. Patel","year":"1999","unstructured":"S. Patel, Z. Ramzan, and G. Sundaram. Towards making Luby-Racko. ciphers optimal and practical. In Proc. Fast Software Encryption 99, Lecture Notes in Computer Science. Springer-Verlag, 1999."},{"key":"18_CR15","series-title":"Lect Notes Comput Sci","volume-title":"On the security of Schnorr\u2019s pseudo random generator","author":"R. A. Rueppel","year":"1989","unstructured":"R. A. Rueppel. On the security of Schnorr\u2019s pseudo random generator. In Proc. EUROCRYPT 89, Lecture Notes in Computer Science. Springer-Verlag, 1989."},{"key":"18_CR16","unstructured":"D. R. Stinson. Comments on definitions of universal hash families, August 2000. Available from: \nhttp:\/\/cacr.math.uwaterloo.ca\/~dstinson\/\n\n."},{"key":"18_CR17","series-title":"Lect Notes Comput Sci","volume-title":"Impossibility and optimality results on constructing pseudorandom permutations","author":"Y. Zheng","year":"1989","unstructured":"Y. Zheng, T. Matsumoto, and H. Imai. Impossibility and optimality results on constructing pseudorandom permutations. In Proc. EUROCRYPT 89, Lecture Notes in Computer Science. Springer-Verlag, 1989."}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36492-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T08:03:55Z","timestamp":1579161835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36492-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540006220","9783540364924"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-36492-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"17 February 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}