Mastering Modular Arithmetic & Cryptography | Foundations of Computer Science

Join Professor Malik Magdon-Ismail as he explores number theory and the core principles of cryptography in this insightful lecture from Rensselaer's Foundations of Computer Science course. Perfect for enthusiasts and students alike! ๐Ÿ”

Mastering Modular Arithmetic & Cryptography | Foundations of Computer Science
M MI
173 views โ€ข Jan 7, 2021
Mastering Modular Arithmetic & Cryptography | Foundations of Computer Science

About this video

Foundations of Computer Science, Rensselaer Fall 2020.

Professor Malik Magdon-Ismail talks about number theory, the foundations cryptography which enables secure communication, email, banking, social media, .... We start from basic divisibility and the greatest common divisor and cover Bezout's identity and the application to Die Hard: With A Vengence. We then switch gears to modular arithmetic and congruences, the cornerstone of modern public key cryptography (for example RSA). We end by illustrating how modular exponentiation is fundamental to RSA.

This is the tenth lecture in a "theory" course focusing on discrete math and the foundations of computing: what can we compute and what can't we compute.

Level of the course: Sophomore Computer Science or related major.

Material is from Chapter 10 of "Discrete Mathematics and Computing", dmc-book.com.

Video Information

Views

173

Likes

2

Duration

27:30

Published

Jan 7, 2021

Related Trending Topics

LIVE TRENDS

Related trending topics. Click any trend to explore more videos.