PK

PKBytes

HomeLearnTechnology
Explore tracks
Chapter 53: Modular Arithmetic and Cryptographic Number Theory
← All DSA chapters

Part IX · Chapter 53

Modular Arithmetic and Cryptographic Number Theory
  1. 53.01Modular foundations
  2. 53.02Exponentiation
  3. 53.03Modular inverses
  4. 53.04Chinese remainder theorem
  5. 53.05Modular combinatorics
  6. 53.06Discrete mathematics connections
  7. 53.07Discrete logarithms
    1. Baby-step giant-step
    2. Pohlig-Hellman overview
    3. Modular square roots Tonelli-Shanks overview
← All DSA chapters

Part IX · Chapter 53

Modular Arithmetic and Cryptographic Number Theory
  1. 53.01Modular foundations
  2. 53.02Exponentiation
  3. 53.03Modular inverses
  4. 53.04Chinese remainder theorem
  5. 53.05Modular combinatorics
  6. 53.06Discrete mathematics connections
  7. 53.07Discrete logarithms
    1. Baby-step giant-step
    2. Pohlig-Hellman overview
    3. Modular square roots Tonelli-Shanks overview
Home/DSA/Modular Arithmetic and Cryptographic Number Theory/Discrete logarithms
53.07Intermediate / Expert3 topics

Discrete logarithms

Part of Chapter 53: Modular Arithmetic and Cryptographic Number Theory.

Outline only

The topics below come from the curriculum. Their written explanations and animations have not been published yet.

53.07.1

Baby-step giant-step

Explanation coming soon.

53.07.2

Pohlig-Hellman overview

Explanation coming soon.

53.07.3

Modular square roots Tonelli-Shanks overview

Explanation coming soon.

← Previous · 53.06

Discrete mathematics connections

Next · 54.01 →

Basic counting

On this page

  • Baby-step giant-step
  • Pohlig-Hellman overview
  • Modular square roots Tonelli-Shanks overview