Nachef, Valerie,, Patarin, Jacques,Volte, Emmanuel. () Feistel ciphers :security proofs and cryptanalysisMLA Citation
Nachef, Valerie,, Patarin, Jacques,Volte, Emmanuel,Feistel Ciphers: Security Proofs And Cryptanalysis. : . Print.
These citations may not conform precisely to your selected citation style. Please use this display as a guideline and modify as needed.
Feistel ciphers : security proofs and cryptanalysis /
Valerie Nachef, Jacques Patarin, Emmanuel Volte.
|Other Names:||Patarin, Jacques, | Volte, Emmanuel,|
|Vernacular:||6.2.4 4 Rounds22.214.171.124 NCPA with m2n/2; 126.96.36.199 KPA with q2n; 6.3 Generic Attacks on Ψ5; 6.3.1 NCPA on Ψ5; 6.3.2 KPA on Ψ5; 6.4 Attacks on Ψr Generators, r≥6; 6.4.1 KPA with r Even; 6.4.2 KPA with r Odd; 6.5 Summary of the Best Known Results on Random Feistel Ciphers; 6.6 Conclusion; Problems; References; 7 Generic Attacks on Classical Feistel Ciphers with Internal Permutations; 7.1 Introduction; 7.2 Generic Attacks for a Small Numbers of Rounds (r ≤5); 7.2.1 Generic Attacks on 3-Round Feistel Networks with Internal Permutations; 188.8.131.52 NCPA with 2n/2 Messages; 184.108.40.206 KPA with 2n Messages.
3 The H-Coefficient Method3.1 Six ``H-coefficient'' Theorems; 3.1.1 Notation: Definition of H; 3.1.2 Theorem in KPA; 3.1.3 Theorems in NCPA; 3.1.4 Theorem in CPA; 3.1.5 Theorems in CCA; 3.1.6 Comments about These Theorems; 3.2 How to Distinguish Random functions from Random Permutations; 3.3 Triangular Evaluation on Generic Designs; 3.4 Example: Exact Values of H for Ψr and q=2; 3.5 Two Simple Composition Theorems in CCA; 3.5.1 A Simple Mathematical Property; 3.5.2 A Composition Theorem in CCAwith H-Coefficients; 3.5.3 A Composition Theorem to Eliminate a ``hole''
5.1 Generic Attacks: Distinguishers5.2 2-Point Attacks and φ-Point Attacks and the Variance Method; 5.2.1 General Description of the Attacks; 5.2.2 Distinguishing Attacks; 5.3 Attacks with More Than 2kn Computations; 5.3.1 Attacks on Generators; 5.3.2 Brute Force Attacks; 5.3.3 Attack by the Signature; 5.4 Further Readings; References; 6 Generic Attacks on Classical Feistel Ciphers; 6.1 Introduction; 6.2 Generic Attacks on 1, 2, 3 and 4 Rounds; 6.2.1 1 Round; 6.2.2 2 Rounds; 220.127.116.11 NCPA with q=2 Messages; 18.104.22.168 KPA with m2n/2; 6.2.3 3 Rounds; 22.214.171.124 KPA with q2n/2; 126.96.36.199 CCA with q=3.
3.5.4 Comments about the Composition TheoremsReferences; 4 Luby-Rackoff Theorems; 4.1 Pseudo-Randomness Notions; 4.2 Results on Ψ3; 4.2.1 The ``H-Property of Ψ3; 4.2.2 ``Main Lemma'' of Luby and Racckoff for Ψ3 from the ``H-property''; 4.3 Results on Ψ4; 4.3.1 The ``H-property'' for Ψ4; 4.3.2 ``Main Lemma'' of Luby and Rackoff for Ψ4 from the ``H-property'' of Ψ4; 4.4 Conclusion: Ψ3 is Pseudo-Random, Ψ4 Is Super Pseudo-Random; 4.4.1 Comments about Luby-Rackoff Theorems; 4.5 Other Results; Problems; References; Part II Generic Attacks; 5 Introduction to Cryptanalysis and Generic Attacks.
|Published:||Cham, Switzerland : Springer, |
|Topics:||Ciphers. | Cryptography. | COMPUTERS - Security - Cryptography.|