Lecture

Introduction to Cryptography: One-Time Pad and Public-Key Systems

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.

Description

This lecture provides an introduction to cryptography, focusing on the one-time pad, perfect secrecy, and public-key cryptography, particularly the Diffie-Hellman method. The instructor explains the fundamental purposes of cryptography, which are privacy and authenticity, emphasizing the importance of preventing sensitive information from falling into the wrong hands and ensuring that information is not falsified. The lecture covers the historical context of cryptography, including ancient systems like Caesar's cipher, and discusses modern cryptographic techniques. The one-time pad is presented as a method that achieves perfect secrecy, where the key is as long as the message and used only once. The instructor also addresses the vulnerabilities of various cryptographic systems and the significance of key management. The lecture concludes with a discussion on the implications of cryptography in the digital age, where sensitive information is frequently transmitted over public channels, necessitating robust security measures.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Official source

Ontological neighbourhood

Computer engineering

Computer security: Public-key cryptography, Cryptanalysis

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.

Encryption

In cryptography, encryption is the process of encoding information. This process converts the original representation of the information, known as plaintext, into an alternative form known as ciphertext. Ideally, only authorized parties can decipher a ciphertext back to plaintext and access the original information. Encryption does not itself prevent interference but denies the intelligible content to a would-be interceptor. For technical reasons, an encryption scheme usually uses a pseudo-random encryption key generated by an algorithm.

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.

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.

One-time pad

In cryptography, the one-time pad (OTP) is an encryption technique that cannot be cracked, but requires the use of a single-use pre-shared key that is larger than or equal to the size of the message being sent. In this technique, a plaintext is paired with a random secret key (also referred to as a one-time pad). Then, each bit or character of the plaintext is encrypted by combining it with the corresponding bit or character from the pad using modular addition.

Related lectures (64)

Perfect Secrecy: One-time Pad

Explores perfect secrecy, the one-time pad encryption method, attacks on encryption systems, and the Vigenère cipher.

Public-Key Cryptography: Fundamentals and Applications

Explores public-key cryptography, covering key exchange, signature schemes, and real-world applications like the Signal protocol.

Ancient Cryptography: Security and Information Theory

Explores ancient cryptography, key security, perfect secrecy, and the Shannon encryption model.

Public-Key Cryptography: Post-Quantum and Access Control

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

Introduction to Cryptography: Basic Concepts