RSA Encryption Algorithm
From Computing and Software Wiki
(Difference between revisions)
(New page: 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 ...) |
|||
| Line 1: | Line 1: | ||
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. | 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'' | ||
| + | |||
| + | <math>\varphi(k) = (i-1)(j-1)\</math> | ||
Revision as of 18:30, 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
<math>\varphi(k) = (i-1)(j-1)\</math>
