Number Theory: Foundations and Applications in Cryptography

Related lectures (25)

Page 1 of 3

Explores the history and concepts of Number Theory, including divisibility and congruence relations.

Introduces modulo arithmetic, Euclid's algorithm, and congruence in number theory.

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

Covers the Diffie-Hellman key exchange protocol and the ElGamal public-key cryptosystem.

Covers commutative groups and their significance in cryptography.

Covers algorithms for big numbers, Z_n, and orders in a group, explaining arithmetic operations and cryptographic concepts.

Explores public-key cryptography, key exchange, and digital signatures, discussing practical applications and security mechanisms.

Explores cryptography, perfect secrecy, group theory, and modern cryptographic milestones, emphasizing the trade-off between security and cost.

Covers the basics of modular arithmetic and its applications in number theory and cryptography.

Explores the Euclidean algorithm, Bézout's identity, extended Euclid algorithm, and commutative groups in mathematics.