Introduction A Brief History of Cryptography and Data Security Cryptography and Data Security in the Modern World Existing Texts Book Organization
Symmetric-Key Cryptography Cryptosystem Overview The Modulo Operator Greatest Common Divisor The Ring Zm Homework Problems
Symmetric-Key Cryptography: Substitution Ciphers Basic Cryptanalysis Shift Ciphers Affine Ciphers Homework Problems
Symmetric-Key Cryptography: Stream Ciphers Random Numbers The One-Time Pad Key Stream Generators Real-World Applications Homework Problems
Symmetric-Key Cryptography: Block Ciphers The Data Encryption Standard The Advanced Encryption Standard
Public-Key Cryptography Issues with Symmetric-Key Cryptosystems Public-Key Cryptosystem Overview One-Way Functions The Euclidean Algorithm The Extended Euclidean Algorithm Euler’s Phi Function Euler’s Theorem Fermat’s Little Theorem Homework Problems
Public-Key Cryptography: RSA Cryptosystem Efficient Implementation Attacks Homework Problems
Public-Key Cryptography: Discrete Logarithms Cyclic Groups The Discrete Logarithm Problem Diffie–Hellman Key Agreement Protocol Efficient Implementation ElGamal Encryption Attacks Homework Problems
Public-Key Cryptography: Elliptic Curves Cryptosystem Diffie–Hellman Key Agreement Protocol Efficient Implementation Menezes–Vanstone Encryption Attacks Homework Problems
Cryptographic Components Digital Signatures Hash Functions Message Authentication Codes
Cryptographic Protocols Security Services Key Establishment Applications Homework Problems
References
Index
|