Chinese Remainder Theorem and Euclidean Domains

Related lectures (32)

Page 3 of 4

Covers the theory and operations related to polynomials, including ideals, minimal polynomials, irreducibility, and factorization.

Covers the calculation of the greatest common divisor using polynomial methods and the Euclidean algorithm.

Covers the Euclidean algorithm for GCD calculation and algorithmic complexity analysis.

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

Introduces number theory and its essential applications in cryptography.

Explores the Chinese remainder theorem in commutative rings and ideals, demonstrating its applications and relevance in finding unique solutions.

Explains polynomial division, factor decomposition, and rational function simplification.

Covers the normalization process of plane algebraic curves, focusing on irreducible polynomials and affine curves.

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

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