{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:08:32Z","timestamp":1725484112728},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440093"},{"type":"electronic","value":"9783540456612"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45661-9_12","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T11:02:03Z","timestamp":1179745323000},"page":"149-163","source":"Crossref","is-referenced-by-count":4,"title":["Non-cryptographic Primitive for Pseudorandom Permutation"],"prefix":"10.1007","author":[{"given":"Tetsu","family":"Iwata","sequence":"first","affiliation":[]},{"given":"Tomonobu","family":"Yoshino","sequence":"additional","affiliation":[]},{"given":"Kaoru","family":"Kurosawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,12]]},"reference":[{"issue":"2","key":"12_CR1","first-page":"143","volume":"18","author":"J. L. Carter","year":"1979","unstructured":"J. L. Carter and M. N. Wegman. Universal classes of hash functions. JCSS, vol. 18, no. 2, pp. 143\u2013154, 1979.","journal-title":"JCSS"},{"key":"12_CR2","series-title":"Lect Notes Comput Sci","first-page":"260","volume-title":"Pre-proceedings of Fast Software Encryption, FSE 2001","author":"H. Gilbert","year":"2002","unstructured":"H. Gilbert and M. Minier. New results on the pseudorandomness of some block cipher constructions. Pre-proceedings of Fast Software Encryption, FSE 2001, pp. 260\u2013277 (to appear in LNCS, Springer-Verlag)."},{"key":"12_CR3","series-title":"Lect Notes Comput Sci","first-page":"245","volume-title":"Pre-proceedings of Fast Software Encryption, FSE 2001","author":"T. Iwata","year":"2002","unstructured":"T. Iwata, T. Yoshino, T. Yuasa and K. Kurosawa. Round security and super-pseudorandomness of MISTY type structure. Pre-proceedings of Fast Software Encryption, FSE 2001, pp. 245\u2013259 (to appear in LNCS, Springer-Verlag)."},{"issue":"2","key":"12_CR4","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 J. Comput., vol. 17, no. 2, pp. 373\u2013386, April 1988.","journal-title":"SIAM J. Comput."},{"key":"12_CR5","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."},{"key":"12_CR6","series-title":"Lect Notes Comput Sci","first-page":"206","volume-title":"Fast Software Encryption, FSE\u2019 96","author":"M. Matsui","year":"1996","unstructured":"M. Matsui. New structure of block ciphers with provable security against differential and linear cryptanalysis. Fast Software Encryption, FSE\u2019 96, LNCS 1039, pp. 206\u2013218, Springer-Verlag."},{"key":"12_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/BFb0052334","volume-title":"Fast Software Encryption, FSE\u2019 97","author":"M. Matsui","year":"1997","unstructured":"M. Matsui. New block encryption algorithm MISTY. Fast Software Encryption, FSE\u2019 97, LNCS 1267, pp. 54\u201368, Springer-Verlag."},{"issue":"1","key":"12_CR8","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.","journal-title":"J. Cryptology"},{"key":"12_CR9","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 \u2014 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 \u2014 CRYPTO 2000, LNCS 1880, pp. 376\u2013393, Springer-Verlag, 2000."},{"issue":"1","key":"12_CR10","first-page":"19","volume":"E80-A","author":"K. Sakurai","year":"1997","unstructured":"K. Sakurai and Y. Zheng. On non-pseudorandomness from block ciphers with provable immunity against linear cryptanalysis. IEICE Trans. Fundamentals, vol. E80-A, no. 1, pp. 19\u201324, April 1997.","journal-title":"IEICE Trans. Fundamentals"},{"key":"12_CR11","first-page":"265","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. JCSS, vol. 22, no. 3, pp. 265\u2013279, 1981.","journal-title":"JCSS"}],"container-title":["Lecture Notes in Computer Science","Fast Software Encryption"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45661-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T20:49:49Z","timestamp":1550350189000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45661-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440093","9783540456612"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45661-9_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}