Indeholder "Preface", "1. Overview of Cryptography and Its Applications", " 1.1 Secure Communications", " 1.2 Cryptographic Applications", "2 Classical Cryptosystems", " 2.1 Shift Ciphers", " 2.2 Affine Ciphers", " 2.3 The Vigenere Cipher", " 2.4 Substitution Ciphers", " 2.5 Sherlock Holmes", " 2.6 The Playfair and ADFGX Ciphers", " 2.7 Block Ciphers", " 2.8 Binary Numbers and ASCII", " 2.9 One-Time Pads", " 2.10 Pseudo-random Bit Generation", " 2.11 LFSR Sequences", " 2.12 Enigma", " 2.13 Exercises", " 2.14 Computer Problems", "3. Basic Number Theory", " 3.1 Basic Notions", " 3.2 Solving ax + by = d", " 3.3 Congruences", " 3.4 The Chinese Remainder Theorem", " 3.5 Modular Exponentiation", " 3.6 Fermat and Euler", " 3.7 Primitive Roots", " 3.8 Inverting Matrices Mod n", " 3.9 Square Roots Mod n", " 3.10 Legendre and Jacobi Symbols", " 3.11 Finite Fields", " 3.12 Continued Fractious", " 3.13 Exercises", " 3.14 Computer Problems", "4. The Data Encryption Standard", " 4.1 Introduction", " 4.2 A Simplified DES-Type Algorithm", " 4.3 Differential Cryptanalysis", " 4.4 DES", " 4.5 Modes of Operation", " 4.6 Breaking DES", " 4.7 Meet-in-the-Middle Attacks", " 4.8 Password Security", " 4.9 Exercises", " 4.10 Computer Problems", "5. The Advanced Encryption Standard: Rijndael", " 5.1 The Basic Algorithm", " 5.2 The Layers", " 5.3 The Decryption", " 5.4 Design Considerations", " 5.5 Exercises", "6. The RSA Algorithm", " 6.1 The RSA Algorithm", " 6.2 Attacks on RSA", " 6.3 Primality Testing", " 6.4 Factoring", " 6.5 The RSA Challenge", " 6.6 An Application to Treaty Verification", " 6.7 The Public Key Concept", " 6.8 Exercises", " 6.9 Computer Problems", "7. Discrete Logarithms", " 7.1 Discrete Logarithms", " 7.2 Computing Discrete Logs", " 7.3 Bit Commitment", " 7.4 Diffie-Hellman Key Exchange", " 7.5 The ElGamal Public Key Cryptosystem", " 7.6 Exercises", " 7.7 Computer Problems", "8. Hash Functions", " 8.1 Hash Functions", " 8.2 A Simple Hash Example", " 8.3 The Secure Hash Algorithm", " 8.4 Birthday Attacks", " 8.5 Multicollisions", " 8.6 The Random Oracle Model", " 8.7 Using Hash Functions to Encrypt", " 8.8 Exercises", " 8.9 Computer Problems", "9. Digital Signatures", " 9.1 RSA Signatures", " 9.2 The ElGamal Signature Scheine", " 9.3 Hashing and Signing", " 9.4 Birthday Attacks on Signatures", " 9.5 The Digital Signature Algorithm", " 9.6 Exercises", " 9.7 Computer Problems", "10. Security Protocols", " 10.1 Intruders-in-the-Middle and Impostors", " 10.2 Key Distribution", " i0.3 Kerberos", " 10.4 Public Key Infrastructures (PKI)", " 10.5 X.509 Certificates", " 10.6 Pretty Good Privacy", " 10.7 SSL and TLS", " 10.8 Secure Electronic Transaction", " 10.9 Exercises", "11. Digital Cash", " 11.1 Digital Cash", " 11.2 Exercises", "12. Secret Sharing Schemes", " 12.1 Secret Splitting", " 12.2 Threshold Schemes", " 12.3 Exercises", " 12.4 Computer Problems", "13. Games", " 13.1 Flipping Coins over the Telephone", " 13.2 Poker over the Telephone", " 13.3 Exercises", "14. Zero-Knowledge Techniques", " 14.1 The Basic Setup", " 11.2 The Feige-Fiat-Sbamir Identification Scheme", " 14.3 Exercises", "15. Information Theory", " 15.1 Probability Review", " 15.2 Entropy", " 15.3 Huffman Codes", " 15.4 Perfect Secrecy", " 15.5 The Entropy of English", " 15.6 Exercises", "16. Elliptic Curves", " 16.1 The Addition Law", " 16.2 Elliptic Curves Mod p", " 16.3 Factoring with Elliptic Curves", " 16.4 Elliptic Curves in Characteristic 2", " 16.5 Elliptic Curvc Cryptosystems", " 16.6 Identity-Based Encryption", " 16.7 Exercises", " 16.8 Computer Problems", "17. Lattice Methods", " 17.1 Lattices", " 17.2 Lattice Reduction", " 17.3 An Attack on RSA", " 17.4 NTRU", " 17.5 Exercises", "18. Error Correcting Codes", " 18.1 Introduction", " 18.2 Error Correcting Codes", " 18.3 Bounds on General Codes", " 18.4 Linear Codes", " 18.5 Hamming Codes", " 18.6 Colay Codes", " 18.7 Cyclic Codes", " 18.8 BCH Codes", " 18.9 Reed-Solomon Codes", " 18.10 The McEliece Cryptosystem", " 18.11 Other Topics", " 18.12 Exercises", " 18.13 Computer Problems", "19. Quantum Techniques in Cryptography", " 19.1 A Quantum Experiment", " 19.2 Quantum Key Distribution", " 19.3 Shor's Algorithm", " 19.4 Exerciscs", "A. Mathematica® Examples", " A.1 Getting Started with Mathematica", " A.2 Some Commands", " A.3 Examples for Chapter 2", " A.4 Examples for Chapter 3", " A.5 Examples for Chapter 6", " A.6 Examples for Chapter 8", " A.7 Examples for Chapter 12", " A.8 Examples for Chapter 13", " A.9 Examples for Chapter 16", "B. Maple® Examples", " B.1 Getting Started with Maple", " B.2 Some Commands", " B.3 Examples for Chapter 2", " B.4 Examples for Chapter 3", " B.5 Examples for Chapter 6", " B.6 Examples for Chapter 8", " B.7 Examples for Chapter 12", " B.8 Examples for Chapter 13", " B.9 Examples for Chapter 16", "C. MATLAB® Examples", " C.1 Getting Started with MATLAB", " C.2 Examples for Chapter 2", " C.3 Examples for Chapter 3", " C.4 Examples for Chapter 6", " C 5 Examples for Chapter 8", " C.6 Examples for Chapter 12", " C.7 Examples for Chapter 13", " C.8 Examples for Chapter 16", "D. Suggestions for Further Reading", "Bibliography", "Index".
Side 50-55 er en beskrivelse af Enigma og nogle af de første succesfulde forsøg på at bryde den.

Bogen er en relativt ny og ganske god introduktion til kryptografi. ( )