Currently browsing tag


Simple Notes on RSA encryption with Python’s Cryptography module

I might as well publish my notes. First, about RSA: You need three numbers and calculate the rest. p and q must be (large) primes. They need to be secret. e needs to be chosen so that a certain function (that indirectly depends on p and q) evaluates to 1. e becomes public. You calculate…