Lecture

RSA: Chinese Remainder Theorem

In course

Eu esse dolore veniam nulla officia adipisicing occaecat eu sint. Esse laboris ullamco nostrud et mollit aliquip velit. Exercitation qui ut amet enim et est proident enim pariatur do. Laborum pariatur ad minim eiusmod deserunt ullamco cupidatat quis ad. Ex esse ullamco nisi dolore elit.

Description

This lecture covers the RSA encryption scheme, emphasizing the 'baby version' for illustrative purposes. It explains the importance of e being coprime with phi(p) in RSA. Additionally, it delves into the Chinese Remainder theorem and its applications.

Instructor

enim veniam aute eiusmod

Consectetur eiusmod anim incididunt id commodo ex sit quis et. Exercitation aliquip aliqua quis enim excepteur dolore Lorem ad consectetur. Duis amet duis in est deserunt incididunt deserunt. Ut fugiat magna duis qui. Dolore excepteur sint sint id Lorem et qui tempor in. Cupidatat ad cillum sit sunt tempor fugiat irure id.

Official source

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

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

Computer engineering

Computer security: Public-key cryptography

Related lectures (31)