Lecture
RSA Cryptography: Computational Problems
Related lectures (32)
Prime Numbers and Primality Testing
Covers prime numbers, RSA cryptography, and primality testing, including the Chinese Remainder Theorem and the Miller-Rabin test.
RSA Cryptography: Primality Testing and Quadratic Residues
Explores RSA cryptography, covering primality testing, quadratic residues, and cryptographic applications.
Quantum Random Number Generation
Explores quantum random number generation, discussing the challenges and implementations of generating good randomness using quantum devices.
Diffie-Hellman Cryptography: Key Exchange and ElGamal Encryption
Covers the Diffie-Hellman key exchange protocol and the ElGamal public-key cryptosystem.
Finite Fields: Construction and Properties
Explores the construction and properties of finite fields, including irreducible polynomials and the Chinese Remainder Theorem.
Diffie-Hellman Cryptography: Key Exchange and Fields
Explores Diffie-Hellman key exchange, group orders, Z_p field, and cryptographic challenges.
Diffie-Hellman Key Exchange
Explores the Diffie-Hellman key exchange protocol, covering computational challenges, subgroup issues, and key wrapping in RFC 2631.
Factoring Polynomials: Complexity and Algorithms
Delves into the complexity of factoring polynomials and the implications for security.
Public-Key Cryptography: Key Exchange and Signatures
Explores public-key cryptography, key exchange, and digital signatures, discussing practical applications and security mechanisms.
Cyclic Groups: Structure and Applications
Explores cyclic groups, generators, isomorphisms, and the discrete logarithm problem in depth, highlighting their importance and applications.