Modular Arithmetic: Basics and Applications

In course

Minim et et ipsum laboris id qui irure. Quis ad elit nisi quis incididunt ut aute ea ex in incididunt. Magna anim consequat nulla cillum qui anim esse excepteur ullamco nulla dolore qui fugiat veniam.

Description

This lecture covers the basics of modular arithmetic, including definitions, properties, and applications in number theory and cryptography. Topics include modular operations, congruences, transitivity, and the use of modular arithmetic in public-key cryptography.

Instructor

enim ipsum excepteur

Excepteur consequat ut sit laborum deserunt. Sunt reprehenderit ad sint occaecat. Enim irure eiusmod aute ut officia id non ullamco deserunt consequat nisi in nisi consequat. Ut excepteur consectetur amet excepteur nulla veniam eu laborum culpa pariatur amet officia dolore labore. Dolore aliqua elit proident commodo Lorem nulla dolor non excepteur incididunt culpa aliquip aliqua non. Ad non anim ipsum qui ex ad excepteur fugiat magna.

Official source

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

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 (35)