Introduction - If you have any usage issues, please Google them yourself
RSA public key encryption algorithm based on the integer factorization great difficulties to the fact. Choice of two prime numbers, p, q. (General p, q very few options) and then calculate the z = p* q = f (p-1) (q-1) Choose a n, so gcd (n, f) = a (gcd representatives greatest common divider. n general also choose a prime number), n and z on as a public key. One's choice, 0