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

Graph
Search

Course

COM-501: Advanced cryptography

Summary

This course reviews some failure cases in public-key cryptography. It introduces some cryptanalysis techniques. It also presents fundamentals in cryptography such as interactive proofs. Finally, it presents some techniques to validate the security of cryptographic primitives.

Lectures

Instructors

Official source

https://edu.epfl.ch/coursebook/en/advanced-cryptography-COM-501

Moodle Page

http://go.epfl.ch/COM-501

About this result

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.

Summary

Lectures

Instructors

Official source

https://edu.epfl.ch/coursebook/en/advanced-cryptography-COM-501

Moodle Page

http://go.epfl.ch/COM-501

About this result

Ontological neighbourhood

Computer engineering

Computer security: Public-key cryptography

Theoretical computer science

Theory of computation: Computational complexity theory

Lectures in this course (13)

Cryptographic Zoo: Fundamentals

Covers fundamental concepts of cryptography, including primitives, security, encryption, and authentication, exploring symmetric and public-key cryptography, key agreement, commitment schemes, and hash functions.

Cryptographic Primitives: Theory and Practice

Explores fundamental cryptographic primitives, security models, and the relationship between decryption security and key recovery security.

Cryptanalysis: Conventional

Explores conventional Cryptanalysis methods, including Differential and Linear Cryptanalysis, and delves into the significance of Hypothesis Testing in Cryptography.

Cryptanalysis: Decorrelation & Proving Security

Explores cryptanalysis through decorrelation techniques and proving security in conventional cryptography, covering topics like distinguishing functions, matrices, and the random oracle model.

Proving Security: Random Oracle Model

Explores the Random Oracle Model, Hybrid ElGamal, and the Fujisaki Okamoto Transform in proving security.

Related courses (29)

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 they work and sketch how they can be implemented. ...

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics as diverse as mathematical reasoning, combinatorics, disc ...

PHYS-467: Machine learning for physicists

Machine learning and data analysis are becoming increasingly central in sciences including physics. In this course, fundamental principles and methods of machine learning will be introduced and practised. ...

MATH-489: Number theory II.d - Cryptography

. ...

COM-102: Advanced information, computation, communication II

Text, sound, and images are examples of information sources stored in our computers and/or communicated over the Internet. How do we measure, compress, and protect the informatin they contain? ...