1. Introduction
1.1 Encryption and Secrecy
1.2 The Objectives of Cryptography
1.3 Attacks
1.4 Cryptographic Protocols
1.5 Provable Security
2. Symmetric-Key Encryption
2.1 Stream Ciphers
2.2 Block Ciphers
2.2.1 DES
2.2.2 Modes of Operation
3. Public-Key Cryptography
3.1 The Concept of Public-Key Cryptography
3.2 Modular Arithmetic
3.2.1 The Integers
3.2.2 The Integers Modulo n
3.3 RSA
3.3.1 Key Generation and Encryption
3.3.2 Digital Signatures
3.3.3 Attacks Against RSA
3.3.4 The Secure Application of RSA Encryption
3.4 Hash Functions
3.4.1 Merkle's Meta Method
3.4.2 Construction of Hash Functions
3.4.3 Probabilistic Signatures
3.5 The Discrete Logarithm
3.5.1 E1Gamal's Encryption
3.5.2 E1Gamal's Signature Scheme
3.5.3 Digital Signature Algorithm
3.6 Modular Squaring
3.6.1 Rabin's Encryption
3.6.2 Rabin's Signature Scheme
4. Cryptographic Protocols
4.1 Key Exchange and Entity Authentication
4.1.1 Kerberos
4.1.2 Diffie-Hellman Key Agreement
4.1.3 Key Exchange and Mutual Authentication
4.1.4 Station-to-Station Protocol
4.1.5 Public-Key Management Techniques
4.2 Identification Schemes
4.2.1 Interactive Proof Systems
4.2.2 Simplified Fiat-Shamir Identification Scheme
4.2.3 Zero-Knowledge
4.2.4 Fiat-Shamir Identification Scheme
4.2.5 Fiat-Shamir Signature Scheme
4.3 Commitment Schemes
4.3.1 A Commitment Scheme Based on Quadratic Residues
4.3.2 A Commitment Scheme Based on Discrete Logarithms
4.3.3 Homomorphic Commitments
4.4 Electronic Elections
4.4.1 Secret Sharing
4.4.2 A Multi-Authority Election Scheme
4.4.3 Proofs of Knowledge
4.4.4 Non-Interactive Proofs of Knowledge
4.4.5 Extension to Multi-Way Elections
4.4.6 Eliminating the Trusted Center
4.5 Digital Cash
4.5.1 Blindly Issued Proofs
4.5.2 A Fair Electronic Cash System
4.5.3 Underlying Problems
5. Probabilistic Algorithms
5.1 Coin-Tossing Algorithms
5.2 Monte Carlo and Las Vegas Algorithms
6. One-Way Functions and the Basic Assumptions
6.1 A Notation for Probabilities
6.2 Discrete Exponential Function
6.3 Uniform Sampling Algorithms
6.4 Modular Powers
6.5 Modular Squaring
6.6 Quadratic Residuosity Property
6.7 Formal Definition of One-Way Functions
6.8 Hard-Core Predicates
7. Bit Security of One-Way Functions
8. One-Way Functions and Pseudorandomness
9. Provably Secure Encryption
10. Provably Secure Digital Signatures
A. Algebra and Number Theory
B. Probabilities and Information Theory
References
Index
鄂公网安备 42010302001612号 