{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:38:01Z","timestamp":1725485881979},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540007166"},{"type":"electronic","value":"9783540365525"}],"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-36552-4_16","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T19:22:37Z","timestamp":1181157757000},"page":"226-237","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On the Universal Hash Functions in Luby-Rackoff Cipher"],"prefix":"10.1007","author":[{"given":"Tetsu","family":"Iwata","sequence":"first","affiliation":[]},{"given":"Kaoru","family":"Kurosawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,3,14]]},"reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J. L. Carter","year":"1979","unstructured":"J. L. Carter and M.N. Wegman. Universal classes of hash functions.J. Comput. Syst. Sci., vol. 18, no. 2, pp. 143\u2013154, 1979. 229","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"16_CR2","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 from pseudorandom functions. SIAM J. Comput., vol. 17, no. 2, pp. 373\u2013386, April 1988. 226","journal-title":"SIAM J. Comput."},{"key":"16_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/3-540-60865-6_53","volume-title":"Fast Software Encryption, FSE\u2019 96","author":"S. Lucks","year":"1996","unstructured":"S. Lucks. Faster Luby-Rackoff ciphers. Fast Software Encryption, FSE\u2019 96, LNCS 1039, pp. 189\u2013203, Springer-Verlag. 226, 227"},{"issue":"1","key":"16_CR4","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 pseudorandom permutations: Luby-Rackoff revised. J. Cryptology, vol. 12, no. 1, pp. 29\u201366, Springer-Verlag, 1999. 226","journal-title":"J. Cryptology"},{"key":"16_CR5","unstructured":"Y. Ohnishi. A study on data security. Master\u2019s Thesis (in Japanese), Tohoku University, 1988. 226"},{"key":"16_CR6","series-title":"Lect Notes Comput Sci","first-page":"193","volume-title":"Pseudorandom permutations based on the DES scheme","author":"J. Patarin","year":"1990","unstructured":"J. Patarin. Pseudorandom permutations based on the DES scheme. Proceedings of EUROCODE\u2019 90, LNCS 514, pp. 193\u2013204, Springer-Verlag, 1990. 226"},{"key":"16_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-46766-1_25","volume-title":"Advances in Cryptology-CRYPTO\u2019 91","author":"J. Patarin","year":"1991","unstructured":"J. Patarin. New results of pseudorandom permutation generators based on the DES scheme. Advances in Cryptology-CRYPTO\u2019 91, LNCS 576, pp. 301\u2013312, Springer-Verlag, 1991. 226"},{"key":"16_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-47555-9_22","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 92","author":"J. Patarin","year":"1992","unstructured":"J. Patarin. How to construct pseudorandom and super pseudorandom permutations from one single pseudorandom function. Advances in Cryptology-EUROCRYPT\u2019 92, LNCS 658, pp. 256\u2013266, Springer-Verlag, 1992. 226, 227"},{"key":"16_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-48519-8_13","volume-title":"Fast Software Encryption, FSE\u2019 99","author":"S. Patel","year":"1999","unstructured":"S. Patel, Z. Ramzan, and G. Sundaram. Towards making Luby-Rackoff ciphers optimal and practical. Fast Software Encryption, FSE\u2019 99, LNCS 1636, pp. 171\u2013185, Springer-Verlag, 1999. 226, 227, 228, 229, 230"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"S. Patel, Z. Ramzan, and G. Sundaram. Luby-Rackoff ciphers: Why XOR is not so exclusive. Preproceedings of Selected Areas in Cryptography, SAC 2002, 2002. 226","DOI":"10.1007\/3-540-36492-7_18"},{"key":"16_CR11","series-title":"Lect Notes Comput Sci","first-page":"140","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 90","author":"J. Pieprzyk","year":"1990","unstructured":"J. Pieprzyk. How to construct pseudorandom permutations from single pseudorandom functions.Advances in Cryptology-EUROCRYPT\u2019 90, LNCS 473, pp. 140\u2013150, Springer-Verlag, 1990. 226, 227"},{"key":"16_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/3-540-44598-6_24","volume-title":"Advances in Cryptology-CRYPTO 2000","author":"Z. Ramzan","year":"2000","unstructured":"Z. Ramzan and L. Reyzin. On the round security of symmetric-key cryptographic primitives. Advances in Cryptology-CRYPTO 2000, LNCS 1880, pp. 376\u2013393, Springer-Verlag, 2000. 229, 230"},{"key":"16_CR13","series-title":"Lect Notes Comput Sci","first-page":"423","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 89","author":"R. A. Rueppel","year":"1989","unstructured":"R. A. Rueppel. On the security of Schnorr\u2019s pseudorandom generator. Advances in Cryptology-EUROCRYPT\u2019 89, LNCS 434, pp. 423\u2013428, Springer-Verlag, 1989. 226"},{"key":"16_CR14","series-title":"Lect Notes Comput Sci","first-page":"194","volume-title":"Advances in Cryptology-AISACRYPT\u2019 91","author":"B. Sadeghiyan","year":"1991","unstructured":"B. Sadeghiyan and J. Pieprezyk. On necessary and sufficient conditions for the construction of super pseudorandom permutations. Advances in Cryptology-AISACRYPT\u2019 91, LNCS 739, pp. 194\u2013209, Springer-Verlag, 1991. 226"},{"key":"16_CR15","series-title":"Lect Notes Comput Sci","first-page":"267","volume-title":"Advances in Cryptology-EUROCRYPT\u201992","author":"B. Sadeghiyan","year":"1992","unstructured":"B. Sadeghiyan and J. Pieprezyk. A construction of super pseudorandom permutations from a single pseudorandom function. Advances in Cryptology-EUROCRYPT\u201992, LNCS 658, pp. 267\u2013284, Springer-Verlag, 1992. 226"},{"key":"16_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/3-540-45961-8_19","volume-title":"Advances in Cryptology-EUROCRYPT\u2019 88","author":"C.P. Schnorr","year":"1988","unstructured":"C.P. Schnorr. On the construction of random number generators and random function generators. Advances in Cryptology-EUROCRYPT\u2019 88, LNCS 330, pp. 225\u2013232, Springer-Verlag, 1988. 226"},{"key":"16_CR17","first-page":"7","volume":"114","author":"D. R. Stinson","year":"1996","unstructured":"D. R. Stinson. On the connections between universal hashing, combinatorial designs and error-correcting codes. Congressus Numerantium, vol. 114, pp. 7\u201327, 1996. 227","journal-title":"Congressus Numerantium"},{"issue":"3","key":"16_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M.N. Wegman","year":"1981","unstructured":"M.N. Wegman and J. L. Carter. New hash functions and their use in authentication and set equality. J. Comput. Syst. Sci., vol. 22, no. 3, pp. 265\u2013279, 1981. 229","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR19","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-EUROCRYPT\u2019 89","author":"Y. Zheng","year":"1990","unstructured":"Y. Zheng, T. Matsumoto, and H. Imai. Impossibility and optimality results on constructing pseudorandom permutations. Advances in Cryptology-EUROCRYPT\u2019 89, LNCS 434, pp. 412\u2013422, Springer-Verlag, 1990. 226"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology \u2014 ICISC 2002"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36552-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:44:54Z","timestamp":1558259094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36552-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540007166","9783540365525"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-36552-4_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"14 March 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}