All the math of the RSA Cryptosystem
Автор: Don Sheehy Lectures
Загружено: 2023-11-20
Просмотров: 600
Описание:
This video covers (almost) all of the math needed for the RSA cryptosystem, the generation of keys, and the proof of correctness. It includes:
1. The Extended Euclidean Algorithm
2. Division mod N
3. Fermat's Little Theorem
4. Euler's Totient Theorem
5. Reducing Exponents in Modular Arithmetic
6. The Correctness of RSA
7. How to Break RSA with Factoring
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке: