Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Discrete Log Problem: Index Calculus

In course

MATH-489: Number theory II.d - Cryptography

. ...

Description

This lecture delves into the discrete log problem and the index calculus method, exploring how collecting enough relations can lead to solving a linear system for the discrete log problem. The instructor discusses the complexity analysis, linear algebra operations, safe primes, factor base, and applications of the discrete log problem in cryptography.

Instructor

Dimitar Petkov Jetchev

Official source

Related concepts (32)

Elliptic-curve cryptography

Elliptic-curve cryptography (ECC) is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. ECC allows smaller keys compared to non-EC cryptography (based on plain Galois fields) to provide equivalent security. Elliptic curves are applicable for key agreement, digital signatures, pseudo-random generators and other tasks. Indirectly, they can be used for encryption by combining the key agreement with a symmetric encryption scheme.

Algebraic variety

Algebraic varieties are the central objects of study in algebraic geometry, a sub-field of mathematics. Classically, an algebraic variety is defined as the set of solutions of a system of polynomial equations over the real or complex numbers. Modern definitions generalize this concept in several different ways, while attempting to preserve the geometric intuition behind the original definition. Conventions regarding the definition of an algebraic variety differ slightly.

Cipher

In cryptography, a cipher (or cypher) is an algorithm for performing encryption or decryption—a series of well-defined steps that can be followed as a procedure. An alternative, less common term is encipherment. To encipher or encode is to convert information into cipher or code. In common parlance, "cipher" is synonymous with "code", as they are both a set of steps that encrypt a message; however, the concepts are distinct in cryptography, especially classical cryptography.

Morphism of algebraic varieties

In algebraic geometry, a morphism between algebraic varieties is a function between the varieties that is given locally by polynomials. It is also called a regular map. A morphism from an algebraic variety to the affine line is also called a regular function. A regular map whose inverse is also regular is called biregular, and the biregular maps are the isomorphisms of algebraic varieties.

Elliptic curve

In mathematics, an elliptic curve is a smooth, projective, algebraic curve of genus one, on which there is a specified point O. An elliptic curve is defined over a field K and describes points in K^2, the Cartesian product of K with itself. If the field's characteristic is different from 2 and 3, then the curve can be described as a plane algebraic curve which consists of solutions (x, y) for: for some coefficients a and b in K. The curve is required to be non-singular, which means that the curve has no cusps or self-intersections.

Related lectures (35)

Linear Applications: Rank and Ciphers

Covers linear applications, rank, and ciphers, emphasizing the importance of understanding the rank of linear transformations.

Communication Theory of Secrecy Systems

Explores C. E. Shannon's theory of secrecy systems, covering various ciphers and the concept of perfect secrecy in communication systems.

Cryptography: Fundamentals and Applications

Introduces the fundamentals of cryptography, covering symmetric and asymmetric encryption, hash functions, key infrastructure, and data integrity.

Ancient Cryptography: Techniques and Principles

Explores ancient to modern cryptography techniques, including substitution ciphers, frequency analysis, and the Enigma machine.

Algebraic Functions: Two Gendarmes MOOC: Analysis I MOOC: Analysis I (part 4) : Limit of a function, continuous functions