14,443
edits
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 {{mvare}}, {{mvard}} and {{mvarn}} such that with [[modular exponentiation]] for all {{mvarm}}:
:<math>(m^e)^d \equiv m
and that even knowing {{mvare}} and {{mvarn}} or even {{mvarm}} it can be extremely difficult to find {{mvard}}.
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
===Key distribution===
