Lecture
Number Theory: Division, Remainder, Congruence
Related lectures (38)
Quantum Order Finding with QPE
Covers the Quantum Order Finding algorithm using Quantum Phase Estimation (QPE), focusing on Shor's factoring algorithm.
Modular Arithmetic: Exponentiation Optimization
Explores optimizing exponentiation in modular arithmetic for efficient calculations and prime number determination.
Modular Arithmetic: Understanding RSA Cryptosystem
Explores modular arithmetic and its role in the RSA cryptosystem for error detection.
Prime Numbers: Finding and Testing
Covers the definition of a function to determine if a given number is prime.
Integers: Sets, Maps, and Principles
Introduces sets, maps, divisors, prime numbers, and arithmetic principles related to integers.
Prime Numbers: Deterministic Approaches
Introduces deterministic approaches to identify prime numbers and covers algorithms and modular arithmetic for prime number testing.
RSA Cryptography: Primality Testing and Quadratic Residues
Explores RSA cryptography, covering primality testing, quadratic residues, and cryptographic applications.
Primes and Coprime
Explores prime numbers, coprime integers, and their properties in number theory.
Shor's factoring algorithm: Quantum Phase Estimation
Covers Shor's factoring algorithm and the link between order finding and factoring.
Algorithms for Big Numbers: Z_n and Orders
Covers algorithms for big numbers, Z_n, and orders in a group, explaining arithmetic operations and cryptographic concepts.