LEADER 04277nam 22006375 450 001 9911049090603321 005 20260102120710.0 010 $a3-031-99850-2 024 7 $a10.1007/978-3-031-99850-8 035 $a(CKB)44770028900041 035 $a(MiAaPQ)EBC32470963 035 $a(Au-PeEL)EBL32470963 035 $a(DE-He213)978-3-031-99850-8 035 $a(EXLCZ)9944770028900041 100 $a20260102d2026 u| 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aGuide to Feistel Ciphers $eSecurity Proofs and Cryptanalysis /$fby Jacques Patarin, Emmanuel Volte, Benoît Cogliati 205 $a2nd ed. 2026. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2026. 215 $a1 online resource (616 pages) 225 1 $aInformation Security and Cryptography,$x2197-845X 311 08$a3-031-99849-9 327 $aPart 1 Definitions and first security results -- Chapter 1 Classical Feistel ciphers, first properties -- Chapter 2 Generalized Feistel ciphers, first properties -- Chapter 3 Luby-Rackoff Theorems -- Chapter 4 The coefficient H method -- Part 2 Generic Attacks -- Chapter 5 Introduction to cryptanalysis -- Chapter 6 Classical Feistel ciphers -- Chapter 7 Contracting Feistel ciphers -- Chapter 8 Expanding Feistel ciphers -- Chapter 9 Generalized Feistel ciphers -- Chapter 10 Classical Feistel ciphers with internal permutations -- Part 3: DES and other specific Feistel ciphers -- Chapter 11 DES (Definition, differential and linear cryptanalysis of DES) -- Chapter 12 3DES with 2 keys -- Chapter 13: XDES, 3DES with 3 keys -- Chapter 14 Bear-Lion, Cast, RC6, MARS, Coconut, Simon, Lucifer -- Part 4 Improved security results -- Chapter 15 Proofs beyond the birthday bound with the coupling method -- Chapter 16 Proofs beyond the birthday bound with the coefficient H method -- Chapter 17 Proofs based on games -- Chapter 18 Indifferentiability. 330 $aFeistel networks are one of the easiest ways to build pseudorandom permutations. Thanks to this property, many secret key algorithms (symmetric ciphers) have been designed as Feistel networks, and it is possible to design many others. The most famous of them is probably the Data Encryption Standard algorithm, a former U.S. National Institute of Standards and Technology standard block cipher, originally released in 1977. This book provides a comprehensive survey of different kinds of Feistel ciphers, including their definitions and mathematical/computational properties. Topics and features: Description of the best-known attacks against the Data Encryption Standard algorithm, including linear cryptanalysis, differential cryptanalysis, and Davies? attack Generic attacks against balanced, unbalanced, and generalized Feistel networks Up-to-date security analysis of balanced Feistel networks Quantum cryptanalysis of Feistel networks The results consolidated in this volume provide an overview of this important cipher design to researchers and practitioners willing to understand the design and security analysis of Feistel ciphers. 410 0$aInformation Security and Cryptography,$x2197-845X 606 $aCryptography 606 $aData encryption (Computer science) 606 $aData protection 606 $aComputer science$xMathematics 606 $aMathematical statistics 606 $aCryptology 606 $aData and Information Security 606 $aProbability and Statistics in Computer Science 606 $aMathematical Applications in Computer Science 615 0$aCryptography. 615 0$aData encryption (Computer science) 615 0$aData protection. 615 0$aComputer science$xMathematics. 615 0$aMathematical statistics. 615 14$aCryptology. 615 24$aData and Information Security. 615 24$aProbability and Statistics in Computer Science. 615 24$aMathematical Applications in Computer Science. 676 $a005.824 700 $aPatarin$b Jacques$01456998 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9911049090603321 996 $aGuide to Feistel Ciphers$94522077 997 $aUNINA