Content tracking

Book name : An Introduction to Mathematical Cryptography

Contents

Chapter 1 : An Introduction to Cryptography

  • Simple substitution ciphers 😀
  • Divisibility and greatest common divisors
  • Modular arithmetics
  • Prime numbers, unique factorization, and finite fields
  • Powers and primitive roots in finite fields
  • Cryptography before the computer age
  • Symmetric and asymmetric ciphers
  • Exercises

Chapter 2 : Discrete logarithms and Diffie-Hellman

  • The birth of public key cryptography
  • The discrete logarithm problem
  • Diffie–Hellman key exchange
  • The ElGamal public key cryptosystem
  • An overview of the theory of groups
  • How hard is the discrete logarithm problem?
  • A collision algorithm for the DLP
  • The Chinese remainder theorem
  • The Pohlig–Hellman algorithm
  • Rings, quotients, polynomials, and finite fields
  • Exercises