Cryptographyhard400 pts0 solves
Cube Root RSA
A tiny service encrypts short secrets with textbook RSA using the small public exponent e = 3 and no padding. The modulus is 1024 bits, the message is short.
Learning objectives
Understand why unpadded RSA with a small exponent is insecure when m^e < n.
Instructions
Recover the plaintext from n, e and c in challenge.txt.
Prerequisites: Integer arithmetic in Python (big integers) or a calculator that supports them.
Flag format:
cspk{...}Files: challenge.txt (0.7 KB) (download after registering)
References
Write-up
The full write-up and learning takeaways unlock after you solve this challenge — spoilers stay hidden until then.