It is easy to find two distinct large primes pp and q.q.The acronym RSA is made of the initial letters of the surnames of Ron Rivest, Adi Shamir, and Leonard Adleman, who first publicly described the algorithm in 1978 In RSA, this asymmetry is based on the practical difficulty of the factorization of the product of two large prime numbers, the “factoring problem”. The encryption key is public and it is different from the decryption key which is kept secret (private). RSA (Rivest–Shamir–Adleman) is one of the first public-key cryptosystems.
This is a explanation of RSA encryption, along with a simple Python implementation of it.
