Rem, Shinobu, Asuna
Typical RSA challenge and YOU DON'T NEED TO FACTORIZE N every time you see an RSA challenge!
We have,
Let . Now we can apply this here,
With this trick, we can get one of the factors of the public modulus (n) and then simply decrypt the ciphertext!
Flag: wormcon{RSA_And_Fermat's_Little_Theorem!?}
Last updated
Was this helpful?