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 Graph Search.
Lecture
Prime Numbers and Primality Testing
Description
This lecture covers the concepts of prime numbers, primality testing, and RSA cryptography. It explains the Chinese Remainder Theorem, Euler's Totient Function, Carmichael numbers, the Miller-Rabin primality test, and the generation of prime numbers. The instructor discusses the significance of the Fermat test, Carmichael numbers, and the correctness of RSA. The lecture also delves into the implementation of primality tests, the Miller-Rabin criterion, and the ElGamal vs. RSA comparison.
Official source
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.