top | item 31863660 (no title) Moodles | 3 years ago Right, but my question is, why is it the correct value? There's some math theorem which makes it true?m_2 = c^d_q mod q = m^(e * d_q) mod q = m because? discuss order hn newest pbsd|3 years ago That's just how RSA works, via Fermat's little theorem: e * d_q mod (q-1) = 1, so m^(e * d_q) mod q = m^1 mod q = m. Moodles|3 years ago Got it, thank you! unknown|3 years ago [deleted]
pbsd|3 years ago That's just how RSA works, via Fermat's little theorem: e * d_q mod (q-1) = 1, so m^(e * d_q) mod q = m^1 mod q = m. Moodles|3 years ago Got it, thank you! unknown|3 years ago [deleted]
pbsd|3 years ago
Moodles|3 years ago
unknown|3 years ago
[deleted]