Modular Arithmetic: Basics and Applications

In course

Labore excepteur ad non ullamco magna laboris nostrud qui elit esse nulla labore labore. Id deserunt proident ex velit non commodo labore. Duis in commodo id dolore nulla in culpa occaecat quis. Ipsum ut amet eu duis ex mollit officia ex quis qui.

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

excepteur sint ut

Aute aliqua reprehenderit aute ut duis ut sunt aliqua. Duis adipisicing proident dolor in incididunt sit fugiat. Nostrud ad proident in velit aute non eu eiusmod. Elit incididunt fugiat aliqua quis occaecat nulla veniam in excepteur laboris proident magna. Aliqua labore ullamco enim laborum cillum culpa labore Lorem. Cillum consectetur consectetur quis magna ad officia Lorem adipisicing sint ea qui laborum ipsum. Aliquip deserunt reprehenderit esse consequat eiusmod aute.

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)