Modular arithmetic

Related lectures (29)

Page 3 of 3

Covers the basic properties of holomorphic maps and Taylor series expansions in complex analysis.

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

Covers integration on H_pxH and arithmetic topics, focusing on the Hensel Lemma and the process of finding R and S such that R.S-P=0.

Discusses the application of Hensel's lemma in determining nth roots and elements that are nth powers.

Covers Coppersmith's method for finding small roots of polynomials modulo N efficiently.

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

Covers the concepts of ideals, principal ideal domains, and ring homomorphisms.

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

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