**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Lecture# Diffie-Hellman Cryptography: Key Exchange and Fields

Description

This lecture covers the Diffie-Hellman key exchange protocol, the concept of orders in a group, the Z_p field, and the challenges posed by the Discrete Logarithm Problem. It also discusses the computational Diffie-Hellman problem, the Decisional Diffie-Hellman problem, and the implications of hardness depending on the properties of groups.

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

In course

Instructor

Related concepts (57)

COM-401: Cryptography and security

This course introduces the basics of cryptography. We review several types of cryptographic primitives, when it is safe to use them and how to select the appropriate security parameters. We detail how

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.

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.

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.

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.

Computational complexity theory

In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used.

Related lectures (48)

Diffie-Hellman Cryptography: Key Exchange and AttacksCOM-401: Cryptography and security

Explores Diffie-Hellman key exchange, DDH problem, active attacks, and cryptographic protocol challenges.

Diffie-Hellman Cryptography: Key Exchange & ElGamalCOM-401: Cryptography and security

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

Diffie-Hellman Key ExchangeCOM-401: Cryptography and security

Explores the Diffie-Hellman key exchange protocol, covering computational challenges, subgroup issues, and key wrapping in RFC 2631.

Diffie-Hellman Cryptography: Key Exchange and ElGamal EncryptionCOM-401: Cryptography and security

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

Prime Numbers and Primality TestingCOM-401: Cryptography and security

Covers prime numbers, RSA cryptography, and primality testing, including the Chinese Remainder Theorem and the Miller-Rabin test.