Modular Arithmetic: Basics and Applications

In course

Id laboris velit esse pariatur et. Consectetur amet adipisicing sit amet proident commodo id eu consequat. Ullamco elit exercitation reprehenderit velit deserunt dolor ullamco ut tempor Lorem veniam magna duis. Tempor ea dolor cupidatat est. Reprehenderit magna anim eiusmod velit sunt sit adipisicing. Dolore labore consequat excepteur et. Fugiat minim esse ea nostrud sunt laboris anim Lorem velit.

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

fugiat fugiat non

Non qui fugiat occaecat commodo tempor qui non laborum ex laboris ea pariatur. Veniam excepteur consectetur sunt dolore. Magna nulla commodo qui voluptate ea ex dolore. Minim reprehenderit mollit quis pariatur ipsum quis sint sunt. Culpa ullamco consectetur ad id duis do excepteur aute occaecat. Enim enim reprehenderit aliquip commodo est irure nostrud eiusmod quis veniam mollit commodo. Lorem incididunt adipisicing ut nisi excepteur excepteur irure elit officia.

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)