Introduction
Famous encryption algorithms have been a mystery for developers who use them by just getting the implementation from somewhere else.
This implementation of RSA is to understand it and to use it in an easy and customizeable way.
The encryption is based on the formula C = M^e (mod n) where n=p*q and p,q,e are prime numbers.
Descryption is perform with the formula M = C^d (mod n) and d can be calculate using ed = 1 (mod (p-1)(q-1)).
Try implementing RSA yourself, its a real fun :) I love to program mathematics!!!
You will see my other algorithms very soon.
