Galois Fields and Elliptic Curves

Related lectures (32)

Page 3 of 4

Explores RSA encryption principles, factorization challenges, and practical applications in data security.

Explores public-key cryptography, post-quantum systems, and access control mechanisms in depth.

Covers the group law on elliptic curves and its role in key exchange protocols.

Explores Galois theory, unramified primes, roots of polynomials, and finite residual extensions.

Explores isogeny graphs of supersingular elliptic curves, showing optimal mixing times for random walks and applications to cryptography.

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

Covers homomorphic encryption using elliptic curves and its applications in decentralized systems.

Explores Dedekind rings, integral closure, factorization of ideals, and Gauss' Lemma.

Covers the Quadratic Sieve method for integer factorization, emphasizing the importance of choosing the right parameters for efficient factorization.

Explores RSA cryptography, covering primality testing, quadratic residues, and cryptographic applications.