Prime Numbers and Algorithms

Related lectures (27)

Page 1 of 3

Explores optimizing exponentiation in modular arithmetic for efficient calculations and prime number determination.

Covers prime numbers, RSA cryptography, and primality testing, including the Chinese Remainder Theorem and the Miller-Rabin test.

Explores Fermat's Little Theorem, its extensions, primality testing algorithms, and the significance of prime numbers in cryptography.

Covers the fast exponentiation algorithm and its time complexity, prime number properties, and the El-Gamal encryption scheme.

Introduces deterministic approaches to identify prime numbers and covers algorithms and modular arithmetic for prime number testing.

Covers examples of modular exponentiation, complexities, Lame's Theorem, Collatz Conjecture, and prime numbers.

Explores prime numbers, modular arithmetic, Wilson's theorem, and complexity analysis.

Explores RSA cryptography, covering primality testing, quadratic residues, and cryptographic applications.

Explores checking a generator of a group, the Diffie-Hellman key exchange, and cryptographic algorithms.

Explores elementary algebra concepts related to numeric sets and prime numbers, including unique factorization and properties.