History and Basic Cryptographic Concepts / 1: |
Terminology / 1.1: |
Classical Ciphers / 1.2: |
Classification of Attacks / 1.3: |
Protocols, Discrete Log, and Diffie-Hellman / 2: |
Cryptographic Protocols / 2.1: |
The Discrete Log Problem / 2.2: |
Exponentiation Ciphers and Diffie-Hellman / 2.3: |
Public-Key Cryptography / 3: |
One-Way Functions / 3.1: |
Public-Key Cryptosystems and RSA / 3.2: |
ElGamal Cryptosystems / 3.3: |
Symmetric vs. Asymmetric Cryptosystems / 3.4: |
Secret History of Public-Key Cryptography / 3.5: |
Probabilistic Primality Tests / 4: |
Introduction / 4.1: |
Pseudoprimes and Carmichael Numbers / 4.2: |
Solovay-Strassen Test / 4.3: |
Miller-Selfridge-Rabin Test / 4.4: |
Factoring / 5: |
Universal Exponent Method / 5.1: |
Pollard's p - 1 Method / 5.2: |
Lenstra's Elliptic Curve Method / 5.3: |
Multipolynomial Quadratic Sieve / 5.4: |
The Number Field Sieve / 5.5: |
Security of RSA / 6: |
Implementation Attacks / 6.1: |
Exponent Attacks / 6.2: |
Strong Moduli / 6.3: |
Generation of Random Primes / 6.4: |
Authentication / 7: |
Identification, Impersonation, and Signatures / 7.1: |
Digital Signature Schemes / 7.2: |
Digital Cash and Electronic Commerce / 7.3: |
Key Management / 8: |
Secret Sharing / 8.1: |
Key Establishment / 8.2: |
Public-Key Infrastructure (PKI) / 8.3: |
Applications and the Future / 9: |
Secrecy and Authentication / 9.1: |
Other Threats to System Security / 9.2: |
Wireless Security / 9.3: |
Smart Cards and Biometrics / 9.4: |
Letter Frequency Analysis / Appendix A: |
Elementary Complexity Theory / Appendix B: |
Fundamental Facts / Appendix C: |
Solutions to Odd-Numbered Exercises |
Bibliography |
List of Symbols |
Index |
History and Basic Cryptographic Concepts / 1: |
Terminology / 1.1: |
Classical Ciphers / 1.2: |