10 ms·
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.
by pbsd 4y 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.
- deleted 4y ago[deleted]
- Moodles 4y agoGot it, thank you!