Algorithms for Big Numbers: Z_n and Orders

Related lectures (27)

Page 1 of 3

Covers the classification theorem for finite abelian groups and introduces rings, including zero divisors and domains.

Covers the RSA cryptosystem, encryption, decryption, group theory, Lagrange's theorem, and practical applications in secure communication.

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

Explores Diffie-Hellman key exchange, ElGamal cryptosystem, and their security applications in cryptography.

Covers the ring of polynomials, focusing on coefficients and multiplication.

Covers polynomials, their operations, division theorem, and provides illustrative examples.

Introduces number theory and its essential applications in cryptography.

Explores the properties of commutative rings and integral domains in algebra.

Covers the Chinese remainder theorem for commutative rings and integers, polynomial rings, and Euclidean domains.

Covers commutative groups and their significance in cryptography.