Cryptography with Python 17: Implementing RSA in Python #2

preview_player
Показать описание

⏰ Timestamps for content in this video ⏰

00:00 Introduction of prime numbers and Miller-Rabin primality test
02:50 Implementing the Miller-Rabin primality test in Python

🔷🔷 About 🔷🔷

This Fundamental Cryptography in Theory and Python lesson is the 2nd of 3 parts demonstrating, how RSA as a public-key encryption system can be implemented in Python.

In this part, the implementation of the Miller-Rabin primality test is demonstrated, which is then used to generate 2048-bit RSA key-pairs.

All code demonstrated serves educational purposes only.

📝 Resources used and created for code lessons 📝

Рекомендации по теме
Комментарии
Автор

📝 All resources used and created for code lessons can be found here:

cyrillgossi