First Prime Number: p 

This is an educational tool for demonstration purposes only. These primes offer encryption of between 7 and 28 bits of data.
In reality, the primes used for RSA encryption are much larger, allowing for the encryption of many more bits of
data and producing a primary key that it is almost impossible to decrypt.

Second Prime Number: q 

Exponent e 


Common exponent values : 3 (2^{1}+1), 5 (2^{2}+1), 17 (2^{4}+1), 257 (2^{8}+1),
65537 (2^{16}+1). These are Fermat primes.
