Modern cryptanalysis techniques for advanced code breaking
As an instructor at the University of Tulsa, Christopher Swenson could find no relevant text for teaching modern cryptanalysis?so he wrote his own. This is the first book that brings the study of cryptanalysis into the 21st century. Swenson provides a foundation in traditional cryptanalysis, examine...
| Otros Autores: | |
|---|---|
| Formato: | Libro electrónico |
| Idioma: | Inglés |
| Publicado: |
Indianapolis, Indiana :
Wiley
2008.
|
| Edición: | 1st edition |
| Materias: | |
| Ver en Biblioteca Universitat Ramon Llull: | https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009627291506719 |
Tabla de Contenidos:
- Cover; Contents; Title; Copyright; Dedication; About the Author; Credits; Acknowledgments; Introduction; Chapter 1: Simple Ciphers; 1.1 Monoalphabetic Ciphers; 1.2 Keying; 1.3 Polyalphabetic Ciphers; 1.4 Transposition Ciphers; 1.5 Cryptanalysis; 1.6 Summary; Exercises; References; Chapter 2: Number Theoretical Ciphers; 2.1 Probability; 2.2 Number Theory Refresher Course; 2.3 Algebra Refresher Course; 2.4 Factoring-Based Cryptography; 2.5 Discrete Logarithm-Based Cryptography; 2.6 Elliptic Curves; 2.7 Summary; Exercises; References; Chapter 3: Factoring and Discrete Logarithms
- 3.1 Factorization3.2 Algorithm Theory; 3.3 Exponential Factoring Methods; 3.4 Subexponential Factoring Methods; 3.5 Discrete Logarithms; 3.6 Summary; Exercises; References; Chapter 4: Block Ciphers; 4.1 Operations on Bits, Bytes, Words; 4.2 Product Ciphers; 4.3 Substitutions and Permutations; 4.4 Substiuition-Permutation Network; 4.5 Feistel Structures; 4.6 DES; 4.7 FEAL; 4.8 Blowfish; 4.9 AES/Rijndael; 4.10 Block Cipher Modes; 4.11 Skipjack; 4.12 Message Digests and Hashes; 4.13 Random Number Generators; 4.14 One-Time Pad; 4.15 Summary; Exercises; References
- Chapter 5: General Cryptanalytic Methods5.1 Brute-Force; 5.2 Time-Space Trade-offs; 5.3 Rainbow Tables; 5.4 Slide Attacks; 5.5 Cryptanalysis of Hash Functions; 5.6 Cryptanalysis of Random Number Generators; 5.7 Summary; Exercises; References; Chapter 6: Linear Cryptanalysis; 6.1 Overview; 6.2 Matsui's Algorithms; 6.3 Linear Expressions for S-Boxes; 6.4 Matsui's Piling-up Lemma; 6.5 EASY1 Cipher; 6.6 Linear Expressions and Key Recovery; 6.7 Linear Cryptanalysis of DES; 6.8 Multiple Linear Approximations; 6.9 Finding Linear Expressions; 6.10 Linear Cryptanalysis Code; 6.11 Summary; Exercises
- ReferencesChapter 7: Differential Cryptanalysis; 7.1 Overview; 7.2 Notation; 7.3 S-Box Differentials; 7.4 Combining S-Box Characteristics; 7.5 Key Derivation; 7.6 Differential Cryptanalysis Code; 7.7 Differential Cryptanalysis of Feistel Ciphers; 7.8 Analysis; 7.9 Differential-Linear Cryptanalysis; 7.10 Conditional Characteristics; 7.11 Higher-Order Differentials; 7.12 Truncated Differentials; 7.13 Impossible Differentials; 7.14 Boomerang Attack; 7.15 Interpolation Attack; 7.16 Related-Key Attack; 7.17 Summary; Exercises; References; Index
