Lecture

Introduction to Elliptic Curves

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

MATH-489: Number theory II.d - Cryptography

. ...

Description

This lecture introduces the concept of elliptic curves, focusing on their properties and applications in cryptography. The instructor explains how elliptic curves are used in index calculus and other special attacks on the discrete logarithm problem. The lecture covers the motivation behind studying elliptic curves, their shorter computation times compared to other methods, and their significance in public key cryptography. Various topics such as Weierstrass equations, Abel-Jacobi theorem, Mordell's theorem, and Frey curves are discussed in detail.

Instructor

Dimitar Petkov Jetchev

Official source

Related concepts (32)

Cryptography

Cryptography, or cryptology (from κρυπτός "hidden, secret"; and γράφειν graphein, "to write", or -λογία -logia, "study", respectively), is the practice and study of techniques for secure communication in the presence of adversarial behavior. More generally, cryptography is about constructing and analyzing protocols that prevent third parties or the public from reading private messages. Modern cryptography exists at the intersection of the disciplines of mathematics, computer science, information security, electrical engineering, digital signal processing, physics, and others.

Key (cryptography)

A key in cryptography is a piece of information, usually a string of numbers or letters that are stored in a file, which, when processed through a cryptographic algorithm, can encode or decode cryptographic data. Based on the used method, the key can be different sizes and varieties, but in all cases, the strength of the encryption relies on the security of the key being maintained. A key's security strength is dependent on its algorithm, the size of the key, the generation of the key, and the process of key exchange.

Post-quantum cryptography

In cryptography, post-quantum cryptography (PQC) (sometimes referred to as quantum-proof, quantum-safe or quantum-resistant) refers to cryptographic algorithms (usually public-key algorithms) that are thought to be secure against a cryptanalytic attack by a quantum computer. The problem with currently popular algorithms is that their security relies on one of three hard mathematical problems: the integer factorization problem, the discrete logarithm problem or the elliptic-curve discrete logarithm problem.

Public-key cryptography

Public-key cryptography, or asymmetric cryptography, is the field of cryptographic systems that use pairs of related keys. Each key pair consists of a public key and a corresponding private key. Key pairs are generated with cryptographic algorithms based on mathematical problems termed one-way functions. Security of public-key cryptography depends on keeping the private key secret; the public key can be openly distributed without compromising security.

Fermat's Last Theorem

In number theory, Fermat's Last Theorem (sometimes called Fermat's conjecture, especially in older texts) states that no three positive integers a, b, and c satisfy the equation an + bn = cn for any integer value of n greater than 2. The cases n = 1 and n = 2 have been known since antiquity to have infinitely many solutions. The proposition was first stated as a theorem by Pierre de Fermat around 1637 in the margin of a copy of Arithmetica. Fermat added that he had a proof that was too large to fit in the margin.

Related lectures (64)

Public-Key Cryptography: Key Exchange and Signatures

Explores public-key cryptography, key exchange, and digital signatures, discussing practical applications and security mechanisms.

Public-Key Cryptography: Standards and Applications

Discusses public-key cryptography, focusing on standards like RSA, DSA, and AES, and their applications in secure communications.

Elliptic Curves and Lattices

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

RSA: Trapdoor One-Way Functions

Explores RSA encryption, trapdoor functions, hash functions, and cryptographic standards, including a practical example with Apple's iMessage implementation.

Distributed Randomness: Drand