Modular exponentiation

Related lectures (30)

Page 1 of 3

Covers Barrett reduction, Montgomery form of integers, and efficient Montgomery product computation.

Explores windowing exponentiation with base-B representation and precomputed small powers of x for efficient computation.

Covers exponentiation, RSA encryption, big integer multiplication, and primitive roots.

Explores quantum computing fundamentals, quantum Fourier transform, RSA encryption, Shor's algorithm, and experimental implementations.

Introduces symmetric-key cryptosystems and the key concepts for secure communication.

Explores graph mining in social networks, covering modularity algorithms and community detection.

Explores cyclic groups, generators, isomorphisms, and the discrete logarithm problem in depth, highlighting their importance and applications.

Explores quantum random number generation, discussing the challenges and implementations of generating good randomness using quantum devices.

Covers Shor's factoring algorithm, which efficiently factors large numbers using quantum computers.

Covers the Shor algorithm for quantum factorization using tensor methods and graded solutions.