How does one implement the RSA (Encryption/Decryption) Algorithm?
1) How is this algorithm applied in real life? RSA gets its security from factorization problem. Read the source below for more detail. 2) How does one generate two large primes? Large odd number are chosen at random. Factorization algorithms can be used (attempted at least) to factor faster than brute forcing: Trial division, Pollard’s rho, Pollard’s p-1, Quadratic sieve, elliptic curve factorization, Random square factoring, Number field sieve, etc. to check whether the number is prime number or not. 3) How is the arithmetic carried out? For a example of number sieve go here to website below: http://www.daniweb.com/code/snippet305.h… Or read here to find out more: http://en.wikipedia.org/wiki/Primality_t… http://en.wikipedia.org/wiki/Pollard%27s… 4) Raisin
