RSA Encryption Algorithm
From Computing and Software Wiki
(→Key Generation) |
(→Key Generation) |
||
| Line 12: | Line 12: | ||
''k = ij'' | ''k = ij'' | ||
| - | 3. Compute the Totient of k. T(k) = (i-1)(j-1) | + | 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 [http://en.wikipedia.org/wiki/Coprime coprime]. | + | 4. Choose an integer e such that ''1 < e < T(k)'', and ''e'' and ''T(k)'' are [http://en.wikipedia.org/wiki/Coprime coprime]. e is the public key. |
| + | |||
| + | 5. Compute d such that ''ed = 1 mod(T(k))''. In other words ''ed mod (T(k)) = 0'' | ||
Revision as of 19:24, 10 April 2009
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.
5. Compute d such that ed = 1 mod(T(k)). In other words ed mod (T(k)) = 0
