5. To generate a couple of keys (KP; Kp), first there are chosen aleatoriamente two prime big numbers, p and q (of approximately 200 numbers each one, for example). Later the product is calculated n = p.q.
6.
7.
8. It is necessary to make notice that with this algorithm the messages that are coded and decipher are entire numbers of minor size that n, not free letters as in case of the codings Caesar or Vigènere. To obtain the ciphered message C from the message in clear M, the following operation is realized: C = Me (mod n).
9.
10. To recover the original message from the coding the following operation is realized: M = CD (mod n).
12. CD (mod n) = (Me) d (mod n) = M1+k (p-1) (q-1) (mod n) = (M (p-1) (q-1)) k. M (mod n) [i].
13. If we remember, the function of Euler f (n) = (p-1) (q-1), and that in general, except improbable random, have that mcd (M, p) =mcd (M, q) =mcd (M, n) =1.
17. M = (Me mod n) d mod n = Md.e mod n = (Md mod n) and mod n = M. This supposes that if coding M with the public key and and later deciphering the result with the private road d we obtain again M, also we can code M with the private key d and decipher the result with the public key and, returning to obtain M.
18. Videos of example of code of the algorithm RSA Video of encrypted RSA university of loja: http://www.youtube.com/watch?v=9ReP4lmExmc&feature=related video of encriptacion RSA: http://www.youtube.com/watch?v=kbIonkBgY4Q&feature=related
19. algorithm rsa1 (part 1): http://www.youtube.com/watch?v=Zf9h3M7-rk0&feature=related algorithm rsa2 (part 2): http://www.youtube.com/watch?v=MvnJ2Rhu_dU&feature=related It paginates of algorimo RSA: http://www.elguille.info/net/dotnet/encriptar_rsa_cifrar_descifrar.aspx
![RSA ,[object Object]](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)