Mind Your Ps and Qs
In RSA, a small e value can be problematic, but what about N? Can you decrypt this? values
This is typical RSA decryption. We are given n
, e
and c
.
If you don't know much about RSA, check out my overview!
All we need are the factors of N
. Because it's small, we can try and check if the factors are known using FactorDB. And they are! So from here it's just standard RSA:
Last updated