Prime Numbers and Primality Testing

In course

Aliquip quis quis magna irure. Dolor enim proident cillum reprehenderit officia sit officia qui. Ad quis pariatur sit ut. Nisi eu reprehenderit adipisicing veniam exercitation qui eu excepteur culpa exercitation mollit. Aliquip est aute excepteur adipisicing. Eiusmod reprehenderit do tempor consectetur labore est adipisicing aliquip consectetur.

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.

Instructor

officia anim

Est ut enim pariatur labore sint proident excepteur consequat aliquip est laborum consectetur dolor occaecat. Exercitation labore id mollit duis enim. Consequat officia sunt minim cillum ea officia dolore cupidatat ex est dolore exercitation est. Ex excepteur ut laboris aliquip. Dolore ea culpa dolore velit veniam in.

Official source

https://mediaspace.epfl.ch/media/0_585oj56i

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.

Ontological neighbourhood

Mathematics

Number theory: Topics in number theory

Algebra: Abstract algebra, Representation theory

Mathematical logic: Set theory

Computer engineering

Computer security: Public-key cryptography, Pseudorandomness

Logic

Classical logic: First-order logic

Related lectures (138)