{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:34:42Z","timestamp":1767339282664},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540642657"},{"type":"electronic","value":"9783540697107"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-69710-1_8","type":"book-chapter","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T16:50:55Z","timestamp":1186678255000},"page":"103-121","source":"Crossref","is-referenced-by-count":34,"title":["About Feistel Schemes with Six (or More) Rounds"],"prefix":"10.1007","author":[{"given":"Jacques","family":"Patarin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1998,10,16]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"W. Aiello, R. Venkatesan, Foiling birthday attacks in length-doubling transformations, EUROCRYPT\u201996, Springer-Verlag, pp. 307\u2013320.","DOI":"10.1007\/3-540-68339-9_27"},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"M. Luby, C. Rackoff, How to construct pseudorandom permutations from pseudorandom functions, SIAM Journal on Computing, vol. 17, n. 2, pp. 373\u2013386, April 1988.","journal-title":"SIAM Journal on Computing"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"M. Naor, O. Reingold, On the Construction of Pseudo-Random Permutations: Luby-Rackoff revisited, Electronic Colloquium on Computational Complexity (ECCC), Report TR 97-005. Preliminary version in: Proc. 29th Ann. ACM Symp. on Theory of Computing, 1997, pp. 189\u2013199. To appear in the Journal of Cryptology.","DOI":"10.1145\/258533.258581"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"U. Maurer, A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators, EUROCRYPT\u201992, Springer-Verlag, pp. 239\u2013255.","DOI":"10.1007\/3-540-47555-9_21"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF00196773","volume":"4","author":"U. Maurer","year":"1991","unstructured":"U. Maurer, J. Massey, Local randomness in pseudorandom sequences, Journal of Cryptology, vol. 4, pp. 135\u2013149, 1991.","journal-title":"Journal of Cryptology"},{"key":"8_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/3-540-54303-1_131","volume-title":"EUROCODE\u201990","author":"J. Patarin","year":"1991","unstructured":"J. Patarin, Pseudorandom Permutations based on the DES Scheme, EUROCODE\u201990, LNCS 514, Springer-Verlag, pp. 193\u2013204."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"J. Patarin, New results on pseudorandom permutation generators based on the DES scheme, CRYPTO\u201991, Springer-Verlag, pp. 301\u2013312.","DOI":"10.1007\/3-540-46766-1_25"},{"key":"8_CR8","unstructured":"J. Patarin, \u00c9tude des G\u00e9n\u00e9rateurs de Permutations Pseudo-al\u00e9atoires bas\u00e9s sur le sch\u00e9ma du DES, Ph.D. Thesis, Universit\u00e9 Paris VI, November 1991."},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"J. Patarin, Improved security bounds for pseudorandom permutations, 4th ACM Conference on Computer and Communications Security, April 1\u20134, 1997, pp. 142\u2013150.","DOI":"10.1145\/266420.266452"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"J. Pieprzyk, How to construct pseudorandom permutations from single pseudorandom functions, EUROCRYPT\u201990, Springer-Verlag, pp. 140\u2013150.","DOI":"10.1007\/3-540-46877-3_12"},{"key":"8_CR11","unstructured":"S. Vaudenay, La S\u00e9curit\u00e9 des Primitives Cryptographiques, Ph.D. Thesis, \u00c9cole Normale Sup\u00e9rieure, April 1995, section II.8: \u201cLes multipermutations\u201d."}],"container-title":["Lecture Notes in Computer Science","Fast Software Encryption"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69710-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T17:59:04Z","timestamp":1556733544000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69710-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540642657","9783540697107"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-69710-1_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}