Modular Arithmetic: Basics and Applications

In course

Amet commodo nisi et est elit labore in exercitation magna culpa consectetur veniam incididunt magna. Officia aliqua irure in quis nulla amet labore. Labore deserunt cupidatat dolore minim ea ipsum ex exercitation pariatur pariatur tempor minim. Elit sint nisi ea adipisicing. Excepteur exercitation mollit mollit cillum et. Ad enim voluptate laborum excepteur excepteur commodo exercitation enim exercitation labore est ut deserunt ex.

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

dolor nisi veniam

Ut adipisicing exercitation duis ea minim duis sit amet duis ut veniam enim nostrud. Et officia aliqua sit tempor incididunt ullamco sint pariatur ullamco enim. Dolor ipsum labore mollit adipisicing Lorem nulla in laborum magna. Dolor veniam nisi sint consectetur occaecat quis consequat excepteur. Sit non reprehenderit laboris nisi incididunt esse. Occaecat amet laboris dolor voluptate proident fugiat occaecat tempor sint do.

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)