Concept

Discrete logarithm

Related lectures (21)

Explores cryptanalysis in public-key cryptography, covering attacks, algorithms, and security models.

Explores cyclic groups, generators, isomorphisms, and the discrete logarithm problem in depth, highlighting their importance and applications.

Explores Diffie-Hellman key exchange, group orders, Z_p field, and cryptographic challenges.

Introduces symmetric-key cryptosystems and the key concepts for secure communication.

Explores the discrete log problem and index calculus method in cryptography.

Explores key generation, cryptography limitations, public key systems, and Diffie-Hellman exchange.

Covers proper actions of groups on Riemann surfaces and introduces algebraic curves via square roots.

Explores integer factorization using the quadratic sieve method and the challenges of working with algebraic number fields.

Explores checking a generator of a group, the Diffie-Hellman key exchange, and cryptographic algorithms.

Covers the basics of elliptic curves, their significance in cryptography, and their applications in public key cryptography.

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

Explores Elliptic Curve Discrete Logarithm Problem, lattice-based cryptography, and cryptographic schemes like ECDSA.

Explores public key cryptography, focusing on RSA, key generation, encryption, decryption, security challenges, and vulnerabilities.

Covers Diffie-Hellman key exchange, DDH problem, ElGamal cryptosystem, and security implications.

Introduces Galois fields, elliptic curves, factorization algorithms, and the discrete logarithm problem in cryptography.

Continues the discussion on Simon's hidden subgroup problem, focusing on finding a basis.

Explores elliptic curves, factoring, and their role in cryptography, emphasizing standardization and applications.

Covers anonymous authorization, zero-knowledge proofs, attribute-based credentials, and practical issues in anonymous authentication.

Covers the Hidden Subgroup Algorithm in quantum computing, emphasizing projectors and measurement postulates.

Explores discrete exponentiation complexity, cyclic groups, and practical cryptography, including popular algorithms like Diffie-Hellman and RSA.