Feistel Ciphers: Security Proofs and Cryptanalysis

✍ Scribed by Valerie Nachef, Jacques Patarin, Emmanuel Volte (auth.)

• Publisher: Springer International Publishing
• Year: 2017
• Tongue: English
• Leaves: 310
• Edition: 1
• Category: Library

✦ Synopsis

This book provides a survey on different kinds of Feistel ciphers, with their definitions and mathematical/computational properties. Feistel ciphers are widely used in cryptography in order to obtain pseudorandom permutations and secret-key block ciphers. In Part 1, we describe Feistel ciphers and their variants. We also give a brief story of these ciphers and basic security results. In Part 2, we describe generic attacks on Feistel ciphers. In Part 3, we give results on DES and specific Feistel ciphers. Part 4 is devoted to improved security results. We also give results on indifferentiability and indistinguishability.

✦ Table of Contents

Front Matter....Pages i-xv
Front Matter....Pages 1-1
Introduction: General Definitions....Pages 3-9
Balanced Feistel Ciphers, First Properties....Pages 11-19
The H-Coefficient Method....Pages 21-43
Luby-Rackoff Theorems....Pages 45-53
Front Matter....Pages 55-55
Introduction to Cryptanalysis and Generic Attacks....Pages 57-64
Generic Attacks on Classical Feistel Ciphers....Pages 65-73
Generic Attacks on Classical Feistel Ciphers with Internal Permutations....Pages 75-94
Generic Attacks on Contracting Feistel Ciphers....Pages 95-116
Generic Attacks on Expanding Feistel Ciphers....Pages 117-138
Generic Attacks on Generalized Feistel Ciphers....Pages 139-153
Front Matter....Pages 155-155
DES and Variants: 3DES, DES – X ....Pages 157-176
GOST, SIMON, BEAR-LION, CAST-256, CLEFIA....Pages 177-190
Front Matter....Pages 191-191
Proof Beyond the Birthday Bound with the Coupling Technique....Pages 193-201
Introduction to Mirror Theory....Pages 203-221
“P i ⊕ P j Theorem” When ξ max = 2....Pages 223-256
“P i ⊕ P j Theorem” on Standard Systems and “P i ⊕ P j Theorem” with Any ξ max ....Pages 257-270
Proofs Beyond the Birthday Bound on Ψ k with the H-Coefficient Method....Pages 271-289
Indifferentiability....Pages 291-296
Back Matter....Pages 297-309

✦ Subjects

Data Encryption;Probability and Statistics in Computer Science;Mathematical Applications in Computer Science