{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T23:06:18Z","timestamp":1769468778519,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642146220","type":"print"},{"value":"9783642146237","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14623-7_33","type":"book-chapter","created":{"date-parts":[[2010,8,10]],"date-time":"2010-08-10T08:15:26Z","timestamp":1281428126000},"page":"613-630","source":"Crossref","is-referenced-by-count":86,"title":["On Generalized Feistel Networks"],"prefix":"10.1007","author":[{"given":"Viet Tung","family":"Hoang","sequence":"first","affiliation":[]},{"given":"Phillip","family":"Rogaway","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/3-540-60865-6_48","volume-title":"Fast Software Encryption","author":"R. Anderson","year":"1996","unstructured":"Anderson, R., Biham, E.: Two practical and provably secure block ciphers: BEAR and LION. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol.\u00a01039, pp. 113\u2013120. Springer, Heidelberg (1996)"},{"key":"33_CR2","unstructured":"Bellare, M., Rogaway, P., Spies, T.: The FFX mode of operation for format-preserving encryption (draft 1.1). NIST submission (February 2010), http:\/\/csrc.nist.gov\/groups\/ST\/toolkit\/BCM\/modes_development.html"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-45760-7_9","volume-title":"Topics in Cryptology - CT-RSA 2002","author":"J. Black","year":"2002","unstructured":"Black, J., Rogaway, P.: Ciphers with arbitrary finite domains. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol.\u00a02271, pp. 114\u2013130. Springer, Heidelberg (2002)"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-05445-7_19","volume-title":"Selected Areas in Cryptography","author":"M. Bellare","year":"2009","unstructured":"Bellare, M., Ristenpart, T., Rogaway, P., Stegers, T.: Format-preserving encryption. In: Jacobson Jr., M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol.\u00a05867, pp. 295\u2013312. Springer, Heidelberg (2009)"},{"key":"33_CR5","unstructured":"Brightwell, M., Smith, H.: Using datatype-preserving encryption to enhance data warehouse security. In: 20th NISSC Proceedings, pp. 141\u2013149 (1997), http:\/\/csrc.nist.gov\/nissc\/1997"},{"key":"33_CR6","unstructured":"Coppersmith, D.: Luby-Rackoff: four rounds is not enough. Technical Report RC 20674, IBM (December 1996)"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Feistel, H., Notz, W., Smith, J.: Some cryptographic techniques for machine-to-machine data communications. In: Proc. of the IEEE, vol.\u00a063, pp. 1545\u20131554 (1975)","DOI":"10.1109\/PROC.1975.10005"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Hoang, V., Rogaway, P.: On generalized Feistel networks. Full version of this paper. Cryptology ePrint report 2010\/301, May26 (2010)","DOI":"10.1007\/978-3-642-14623-7_33"},{"key":"33_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/BFb0055728","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"C. Jutla","year":"1998","unstructured":"Jutla, C.: Generalized birthday attacks on unbalanced Feistel networks. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 186\u2013199. Springer, Heidelberg (1998)"},{"key":"33_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/3-540-39799-X_34","volume-title":"Advances in Cryptology","author":"M. Luby","year":"1986","unstructured":"Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 447\u2013447. Springer, Heidelberg (1986)"},{"key":"33_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/3-540-60865-6_53","volume-title":"Fast Software Encryption","author":"S. Lucks","year":"1996","unstructured":"Lucks, S.: Faster Luby-Rackoff ciphers. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol.\u00a01039, pp. 189\u2013203. Springer, Heidelberg (1996)"},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-47555-9_21","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"U. Maurer","year":"1993","unstructured":"Maurer, U.: A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generator. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol.\u00a0658, pp. 239\u2013255. Springer, Heidelberg (1993)"},{"key":"33_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/3-540-39200-9_34","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"U. Maurer","year":"2003","unstructured":"Maurer, U., Pietrzak, K.: The security of many-round Luby-Rackoff pseudo-random permutations. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 544\u2013561. Springer, Heidelberg (2003)"},{"key":"33_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-74143-5_8","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"U. Maurer","year":"2007","unstructured":"Maurer, U., Pietrzak, K., Renner, R.: Indistinguishability amplification. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 130\u2013149. Springer, Heidelberg (2007)"},{"key":"33_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/3-540-45708-9_20","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"I. Mirinov","year":"2002","unstructured":"Mirinov, I. (Not so) random shuffles of RC4. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 304\u2013319. Springer, Heidelberg (2002)"},{"key":"33_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/3-540-44448-3_22","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"S. Moriai","year":"2000","unstructured":"Moriai, S., Vaudenay, S.: On the pseudorandomness of top-level schemes of block ciphers. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 289\u2013302. Springer, Heidelberg (2000)"},{"key":"33_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-03356-8_17","volume-title":"CRYPTO 2009","author":"B. Morris","year":"2009","unstructured":"Morris, B., Rogaway, P., Stegers, T.: How to encipher messages on a small domain: deterministic encryption and the Thorp shuffle. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 286\u2013302. Springer, Heidelberg (2009)"},{"key":"33_CR18","unstructured":"Nachef, V.: Generic attacks on alternating unbalanced Feistel schemes. Cryptology ePrint report 2009\/287, June 16 (2009)"},{"issue":"1","key":"33_CR19","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/PL00003817","volume":"12","author":"M. Naor","year":"1997","unstructured":"Naor, M., Reingold, O.: On the construction of pseudo-random permutations: Luby-Rackoff revisited. Journal of Cryptology\u00a012(1), 29\u201366 (1997)","journal-title":"Journal of Cryptology"},{"key":"33_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BFb0034838","volume-title":"Advances in Cryptology - ASIACRYPT \u201996","author":"K. Nyberg","year":"1996","unstructured":"Nyberg, K.: Generalized Feistel networks. In: Kim, K.-c., Matsumoto, T. (eds.) ASIACRYPT 1996. LNCS, vol.\u00a01163, pp. 91\u2013104. Springer, Heidelberg (1996)"},{"key":"33_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-69710-1_8","volume-title":"Fast Software Encryption","author":"J. Patarin","year":"1998","unstructured":"Patarin, J.: About Feistel schemes with six (or more) rounds. In: Vaudenay, S. (ed.) FSE 1998. LNCS, vol.\u00a01372, pp. 103\u2013121. Springer, Heidelberg (1998)"},{"key":"33_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45682-1_14","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"J. Patarin","year":"2001","unstructured":"Patarin, J.: Generic attacks on Feistel schemes. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 222\u2013238. Springer, Heidelberg (2001)"},{"key":"33_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-540-45146-4_30","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J. Patarin","year":"2003","unstructured":"Patarin, J.: Luby-Rackoff:\u00a07 Rounds are enough for 2 n\u2009\u2212\u2009\u03b5 security. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 513\u2013529. Springer, Heidelberg (2003)"},{"key":"33_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/3-540-46766-1_25","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"J. Patarin","year":"1992","unstructured":"Patarin, J.: New results on pseudorandom permutation generators based on the DES scheme. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 301\u2013312. Springer, Heidelberg (1992)"},{"key":"33_CR25","unstructured":"Patarin, J.: Security of balanced and unbalanced Feistel schemes with linear non equalities. Cryptology ePrint report 2010\/293. May 17 (2010)"},{"key":"33_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/978-3-540-28628-8_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"J. Patarin","year":"2004","unstructured":"Patarin, J.: Security of random Feistel schemes with 5 or more rounds. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 106\u2013122. Springer, Heidelberg (2004)"},{"key":"33_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/11935230_26","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"J. Patarin","year":"2006","unstructured":"Patarin, J., Nachef, V., Berbain, C.: Generic attacks on unbalanced Feistel schemes with contracting functions. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol.\u00a04284, pp. 396\u2013411. Springer, Heidelberg (2006)"},{"key":"33_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-76900-2_20","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"J. Patarin","year":"2007","unstructured":"Patarin, J., Nachef, V., Berbain, C.: Generic attacks on unbalanced Feistel schemes with expanding functions. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 325\u2013341. Springer, Heidelberg (2007)"},{"key":"33_CR29","unstructured":"PCI Security Standards Council. Payment Card Industry (PCI) Data Security Standard: Requirements and Security Assessment Procedures, version 1.2.1 (July 2009), www.pcisecuritystandards.org"},{"key":"33_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/3-540-60865-6_49","volume-title":"Fast Software Encryption","author":"B. Schneier","year":"1996","unstructured":"Schneier, B., Kelsey, J.: Unbalanced Feistel networks and block cipher design. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol.\u00a01039, pp. 121\u2013144. Springer, Heidelberg (1996)"},{"key":"33_CR31","unstructured":"Smith, J.: The design of Lucifer: a cryptographic device for data communications. IBM Research Report RC\u00a03326. IBM T.J.\u00a0Watson Research Center, Yorktown Heights, New York, USA (April 15, 1971)"},{"key":"33_CR32","doi-asserted-by":"publisher","first-page":"842","DOI":"10.2307\/2284510","volume":"68","author":"E. Thorp","year":"1973","unstructured":"Thorp, E.: Nonrandom shuffling with applications to the game of Faro. Journal of the American Statistical Association\u00a068, 842\u2013847 (1973)","journal-title":"Journal of the American Statistical Association"},{"key":"33_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BFb0028566","volume-title":"STACS 98","author":"S. Vaudenay","year":"1998","unstructured":"Vaudenay, S.: Provable security for block ciphers by decorrelation. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 249\u2013275. Springer, Heidelberg (1998)"},{"key":"33_CR34","doi-asserted-by":"crossref","unstructured":"Yun, A., Park, J., Lee, J.: On Lai-Massey and quasi-Feistel ciphers. In: Designs, Codes and Cryptography, Online First (2010)","DOI":"10.1007\/s10623-010-9386-8"},{"key":"33_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/0-387-34805-0_42","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"Y. Zheng","year":"1990","unstructured":"Zheng, Y., Matsumoto, T., Imai, H.: On the construction of block ciphers provably secure and not relying on any unproved hypotheses. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 461\u2013480. Springer, Heidelberg (1990)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14623-7_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:55:42Z","timestamp":1606186542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14623-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642146220","9783642146237"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14623-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}