Prime Numbers and Algorithms

Related lectures (27)

Page 2 of 3

Covers number theory, division, remainder, congruence, prime numbers, integer representation, and the Euclidean algorithm.

Covers classical and quantum computational complexity concepts and implications.

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Delves into the complexity of factoring polynomials and the implications for security.

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Explores the Chinese Remainders Theorem, RSA public-key cryptosystem, bijective properties, and key generation for encryption and decryption.

Explores methods and algorithms for integer factorization, including testing for B smoothness and computing small primes.

Explores algorithmic complexity, comparing growth rates using Theta notation and characterizing different complexity classes.

Explores prime number generation, Diffie-Hellman key exchange, and one-way operations in cryptography with practical examples.