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

MATH-489: Number theory II.d - Cryptography

Summary

Lectures

Instructor

Dimitar Petkov Jetchev

Official source

https://edu.epfl.ch/coursebook/en/number-theory-ii-d-cryptography-MATH-489

Moodle Page

http://go.epfl.ch/MATH-489

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

Instructor

Dimitar Petkov Jetchev

Official source

https://edu.epfl.ch/coursebook/en/number-theory-ii-d-cryptography-MATH-489

Moodle Page

http://go.epfl.ch/MATH-489

About this result

Lectures in this course (26)

Fast Fourier Transform: Polynomial Multiplication

Explains the Fast Fourier Transform algorithm for polynomial multiplication efficiency.

Exponentiation

Covers exponentiation, RSA encryption, big integer multiplication, and primitive roots.

Integer Factorization: Methods and Algorithms

Explores methods and algorithms for integer factorization, including testing for B smoothness and computing small primes.

Integer Factorization: Smoothness and Probabilities

Explores smoothness in integer factorization and probabilities, including the analysis of Dixon's method.

Integer Factorization: Quadratic Sieve

Covers the Quadratic Sieve method for integer factorization, emphasizing the importance of choosing the right parameters for efficient factorization.

Related courses (30)

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 ...

MATH-410: Riemann surfaces

This course is an introduction to the theory of Riemann surfaces. Riemann surfaces naturally appear is mathematics in many different ways: as a result of analytic continuation, as quotients of complex domains under discontinuous group actions, as algebraic ...

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. ...

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? ...