Text
Handbook of Applied Cryptography
Contents:
Chapter 1: Overview of Cryptography
1.1. Introduction
1.2. Information Security and Cryptography
1.3. Background of Functions
1.4. Basic Terminology and Concepts
1.5. Symmteric-Key Encryption
1.6. Digital Signature
1.7. Authentication and Identification
1.8. Public-Key Cryptography
1.9. Hash Function
1.10. Protocols and Mechanisms
1.11. Key Establishment, Management and Certification
1.12. Pseudorandom Numbers and Sequences
1.13. Classes of Attacks and Security Models
1.14. Notes and Further References
Chapter 2: Mathematical Background
2.1. Probability Theory
2.2. Information Theory
2.3. Complexity Theory
2.4. Number Theory
2.5. Abstract Algebra
2.6. Finite Field
2.7. Notes and Further References
Chapter 3: Number-Theoretic Reference Problem
3.1. Introduction and Overview
3.2. The Integer Factorization Problem
3.3. The RSA Problem
3.4. The Quadratic Residousity Problem
3.5. Computing Square Roots in Zn
3.6. The Discrete Logarithm Problem
3.7. The Diffie-Hellman Problem
3.8. Composite Moduli
3.9. Computing Individual Bits
3.10. The Subset Sum Problem
3.11. Factoring Polynomial Over Finite Field
3.12. Notes and Further References
Chapter 4. Public-Key Parameters
4.1. Introduction
4.2. Probabilistic Primality Tests
4.3. (True) Primality Tests
4.4. Prime Number Generation
4.5. Irreducible Polynomial Over Zp
4.6. Generators and Elements of High Order
4.7. Notes and Further References
Chapter 5: Pseudorandom Bits and Sequences
5.1. Introduction
5.2. Rendom Bit Generation
5.3. Pseudorandom Bit Generation
5.4. Statistical Tests
5.5. Cryptograpically Secure Pseudorandom Bit Generation
5.6. Notes and Further References
Chapter 6: Stream Ciphers
6.1. Introduction
6.2. Feedback Shift Registers
6.3. Stream Ciphers based on LFSRs
6.4. Other Stream Ciphers
6.5. Notes and Further References
Chapter 7: Block Ciphers
7.1. Introduction and Overview
7.2. Background and General Concepts
7.3. Classical Ciphers and Historical Development
7.4. DES
7.5. FEAL
7.6. IDEA
7.7. SAFER, RC5 and Other Block Ciphers
7.8. Notes and Further References
Chapter 8: Public-Key Encryption
8.1. Introduction
8.2. RSA Public-Key Encryption
8.3. Rabin Public-Key Encryption
8.4. ElGamal Public-Key Encryption
8.5. McEliece Public-Key Encryption
8.6. Knapsack Public-Key Encryption
8.7. Probabilistic Public-Key Encryption
8.8. Notes and Further References
Chapter 9: Hash Function and Data Integrity
9.1. Introduction
9.2. Classification and Framework
9.3. Basic Constructions and General Results
9.4. Unkeyed Hash Function (MDCs)
9.5. Keyed Hash Function (MACs)
9.6. Data Integrity and Message Authentication
9.7. Advanced Attacks on Hash Functions
9.8. Notes and Further References
Chapter 10: Identification and Entity Authentication
10.1. Introduction
10.2. Password (weak authentication)
10.3. Challenge-Response Identification (strong authentication)
10.4. Customized and Zero-Knowledge Identification Protocols
10.5. Attacks on Identification Protocols
10.6. Notes and Further References
Chapter 11: Digital Signature
11.1. Introduction
11.2. A Framework for Digital Signature Mechanisms
11.3. RSA and Related Signature Schemes
11.4. Fiat-Shamir Signature Schemes
11.5. The DSA and Related Signature Schemes
11.6. One-Time Digital Signature
11.7. Other Signature Schemes
11.8. Signature With Additional Functionality
11.9. Notes and Further References
Chapter 12: Key Establishment Protocols
12.1. Introduction
12.2. Classification and Framework
12.3. Key Transport Based on Symmetric Encryption
12.4. Key Agreement Based on Symmetric Techniques
12.5. Key Transport Based on Public-Key Encryption
12.6. Key Agreement Based on Asymmetric Techniques
12.7. Secret Sharing
12.8. Conference Keying
12.9. Analysis of Key Establishment Protocols
12.10. Notes and Further References
Chapter 13: Key Management Techniques
13.1. Introduction
13.2. Background and Basic Concepts
13.3. Techniques for Distributing Confidential Keys
13.4. Techniques for Distributing Public Keys
13.5. Techniques for Controlling Key Usage
13.6. Key Management Involving Multiple Domains
13.7. Key Life Cicle Issues
13.8. Advanced Trusted Third Party Services
13.9. Notes and Further References
Chapter 14: Efficient Implementation
14.1. Introduction
14.2. Multiple-Precision Integer Arithmetic
14.3. Multiple-Precision Modular Arithmetic
14.4. Greatest Common Divisor Algorithms
14.5. Chinese Remainder Theorem for Integer
14.6. Exponentiation
14.7. Exponent Recoding
14.8. Notes and Further References
Chapter 15: Patents and Standards
15.1. Introduction
15.2. Patents on Cryptographic Techniques
15.3. Cryptographic Standards
15.4. Notes and Further References
Bibliography of Papers from Selected Cryptographic Forums
13.3.
No other version available