RSA

  1. Key Generation
  2. Encryption
  3. Decryption
  4. Signature
  5. Verification
  6. Questions
  7. Padding
https://cryptotools.net/rsagen https://raskeyconverter.azurewebsites.net/PemToXml?handler=ConvertXML 
-------------------------
m^phi(n) = 1 (mod n)    ensure m and n are relative prime

m^phi(p) = 1 (mod p)
m^phi(q) = 1 (mod q)

m^(p-1) = 1 (mod p)
m^(q-1) = 1 (mod q)

1 = m^(p-1) (mod p)
1 = m^(q-1) (mod q)

Chinese Remainder Theorem

1 = m^(p-1) * m^(q-1) (mod pq)
------------------------