RSA Encryption Algorithm

From Computing and Software Wiki

Revision as of 15:53, 12 April 2009 by Holtzmt (Talk)
Jump to: navigation, search

The RSA Encryption Algorithm is a form of encryption used in Public Key Encryption Algorithms. The algorithm consists of three phases, Key Generation, Encryption, and Decryption. It is the first publicly disclosed algorithm suitable for digital signing.


Algorithm

The RSA Algorithm consists of three phases, Key Generation, Encryption, and Decryption.

Key Generation

RSA utilizes two keys, a Public Key, and a Private key. These keys are created in the following way.

1. Two suitably large different prime numbers are randomly generated, i, j.

2. The product of these two numbers is calculated and used as the modulus for both the public, and private keys. k = ij

3. Compute the Totient of k. T(k) = (i-1)(j-1)

4. Choose an integer e such that 1 < e < T(k), and e and T(k) are coprime. e is the Public Key Exponent.

5. Compute d such that ed = 1 mod(T(k)). In other words ed mod (T(k)) = 0. d is the Private Key Exponent.


Encryption

Personal tools