|
| 1 | +## RSA |
| 2 | + One of the first public-key cryptosystems and is widely used for secure data transmission. In such a cryptosystem, the encryption key is public and it is different from the decryption key which is kept secret (private). In RSA, this asymmetry is based on the practical difficulty of the factorization of the product of two large prime numbers, the **factoring problem**. |
| 3 | + |
| 4 | +#### Designers |
| 5 | +Ron Rivest, Adi Shamir, and Leonard Adleman |
| 6 | + |
| 7 | +--------------- |
| 8 | + |
| 9 | + |
| 10 | +-------------- |
| 11 | +#### Operation |
| 12 | + |
| 13 | +A basic principle behind RSA is the observation that it is practical to find three very large positive integers e, d and n such that with modular exponentiation for all integer m (with 0 ≤ m < n): |
| 14 | +** (m^e)^d ~ m mod n ** |
| 15 | +and that even knowing e and n or even m it can be extremely difficult to find d. |
| 16 | + |
| 17 | +[More info](https://en.wikipedia.org/wiki/RSA_(cryptosystem) |
0 commit comments