Lecture

Cryptography: General Framework

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 covers the basic principles of cryptography, including symmetric and asymmetric cryptography, confidentiality, integrity, and responsibility. It explains the goals of cryptography, such as combating information theft, manipulation, destruction, denial, identity theft, and bypassing defenses. The lecture also delves into encryption, decryption, and the importance of confidentiality, integrity, and responsibility in information security. Different levels of attack scenarios are discussed, along with examples of symmetric and asymmetric encryption systems like One-Time Pad, RSA, and Diffie-Hellman. The lecture emphasizes the universal need for encryption, especially in the era of cloud computing.

Official source

Ontological neighbourhood

Computer engineering

Computer security: Public-key cryptography

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.

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.

Related lectures (64)

Cryptography Basics

Covers authentication, authorization, encryption techniques, vulnerabilities, and the impact of quantum computing on cryptography.

Introduction to Cryptography: Fundamentals and Applications

Covers the fundamentals of cryptography, including symmetric encryption, digital signatures, and secure communication standards.

Asymmetric Cryptography: Basics and Applications

Explores asymmetric cryptography basics, including encryption, signatures, and Diffie-Hellman, along with advanced topics like RSA and quantum computing implications.

Public-Key Cryptography: Standards and Applications

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

Cryptographic Security Fundamentals