The following is a table of contents for Introduction to Cryptography with Coding Theory.
- Overview of Cryptography and its Applications
- Classical Cryptosystems
- Shift Ciphers
- Affine Ciphers
- The Vigenère Cipher
- Substitution Ciphers
- Sherlock Holmes
- The playfair and ADFGX Ciphers
- Block Ciphers
- Binary Numbers and ASCII
- One-Time Pads
- Pseudo-Random Bit Generation
- LSFR Sequences
- Enigma
- Basic Number Theory
- Basic Notions
- Solving ax + by = d
- Congruences
- The Chinese Remainder Theorem
- Modular Exponentiation
- Fermat and Euler
- Primitive Roots
- Inverting Matrices Mod n
- Square Roots and Mod n
- Legendre and Jacobi Symbols
- Finite Fields
- Continued Fractions
- The Data Encryption Standard
- The Advanced Encryption Standard: Rijndael
- The RSA Algorithm
- The RSA Algorithm
- Attacks on the RSA
- Primality Testing
- Factoring
- The RSA Challenge
- An Application to Treaty Verification
- The Public Key Concept
- Discrete Logarithms
- Discrete Logarithms
- Computing Discrete Logs
- Bit Commitment
- Diffie-Hellman Key Exchange
- The ElGamal Public Key Cryptosystem
- Hash Functions
- Digital Signatures
- Security Protocols
- Digital Cash
- Secret Sharing Schemes
- Games
- Zero-Knowledge Techniques
- The Basic Setup
- The Feige-Fiat-Shamir Identification Scheme
- Information Theory
- Elliptic curves
- The Addition Law
- Elliptic Curves Mod p
- Factoring with Elliptic Curves
- Elliptic Curves in Characteristic 2
- Elliptic Curve Cryptosystems
- Identity-Based Encryption
- Lattice Methods
- Lattices
- Lattice Reduction
- An attack on RSA
- NTRU
- Error Correction Codes
- Quantum Techniques in Cryptography
No comments:
Post a Comment