Modular exponentiation

Related lectures (30)

Page 3 of 3

Covers the principles of classes, encapsulation, and modular programming in C++.

Covers commutative groups and their significance in cryptography.

Explores discrete exponentiation complexity, cyclic groups, and practical cryptography, including popular algorithms like Diffie-Hellman and RSA.

Explores finding the equation of the tangent line to a function's graph at a point.

Covers mathematical induction, recursively defined functions, and iterative algorithms for problem-solving.

Explores power functions with functions as base and exponent, emphasizing exponential function continuity and derivative analysis.

Covers constructors, destructors, modular programming, separate compilation, and reusability in C++.

Introduces recursive algorithms for factorial, exponentiation, and search.

Covers the Bombieri-Vinogradov theorem and its implications for prime gaps and multiplicative sieve inequalities.

Introduces modular arithmetic, its properties, and applications in cryptography and coding theory.