RSA (cryptosystem): Difference between revisions

Undid revision 762152811 by 84.241.198.57 (talk): if (m^e)^d was m^e, then RSA decryption would do nothing at all
m (borked tag using AWB (12130))
(Undid revision 762152811 by 84.241.198.57 (talk): if (m^e)^d was m^e, then RSA decryption would do nothing at all)
The basic principle behind RSA is the observation that it is practical to find three very large positive integers {{mvar|e}}, {{mvar|d}} and {{mvar|n}} such that with [[modular exponentiation]] for all {{mvar|m}}:
 
:<math>(m^e)^d \equiv m^e \pmod{n}</math>
 
and that even knowing {{mvar|e}} and {{mvar|n}} or even {{mvar|m}} it can be extremely difficult to find {{mvar|d}}.
Additionally, for some operations it is convenient that the order of the two exponentiations can be changed and that this relation also implies:
 
:<math>(m^d)^e \equiv m^e \pmod{n}</math>
 
===Key distribution===