Concept

Modular multiplicative inverse

Related lectures (26)

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

Explores modular arithmetic, emphasizing inverses and equations in Z/mZ, with practical examples and exercises.

Introduces number theory and its essential applications in cryptography.

Covers Barrett reduction, Montgomery form of integers, and efficient Montgomery product computation.

Covers examples of modular exponentiation, complexities, Lame's Theorem, Collatz Conjecture, and prime numbers.

Introduces characters as group homomorphisms from linear algebraic groups to multiplicative groups.

Explores graph mining in social networks, covering modularity algorithms and community detection.

Covers commutative groups and their significance in cryptography.

Explores quantum computing fundamentals, quantum Fourier transform, RSA encryption, Shor's algorithm, and experimental implementations.

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

Covers exponentiation, RSA encryption, big integer multiplication, and primitive roots.

Covers fundamental concepts in number theory with examples and quizzes.

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

Covers Shor's factoring algorithm, which efficiently factors large numbers using quantum computers.

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

Covers the Shor algorithm for quantum factorization using tensor methods and graded solutions.

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

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

Explores quantum random number generation, discussing the challenges and implementations of generating good randomness using quantum devices.

Covers the fast exponentiation algorithm and its time complexity, prime number properties, and the El-Gamal encryption scheme.