ConceptTheory & Algos
Modular exponentiation
Computing large exponentiations efficiently by applying modular reduction steps to keep intermediate values small.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
7Connections
15The lectures that define it or assume it, and the concepts next to it.
Concepts7
- Exponentiation
- Modular arithmetic
- Square-and-multiply algorithm
- Diffie-Hellman key exchange
- Discrete logarithm problem
- Elgamal encryption
Show 1 moreShow fewer
Lectures8
- Modular Arithmetic and Historical Ciphers
- The RSA Cryptosystem and Efficient Exponentiation
- Digital Signatures and Security Services
- Diffie-Hellman Key Exchange and the Discrete Log Problem
- The Generalized Discrete Log Problem and the Security of Diffie-Hellman
- Elgamal Encryption Scheme