Hard
Crypto
300 pts
An intern generated an RSA key, but picked the two primes right next to each other. Recover the private key and decrypt the message. Convert the decrypted number to bytes to read the flag.
n = 29575860949748273245980507584250374549415443004179434534594784808604995958879
e = 65537
c = 23518219175929809343739110742892601563691025481165920216133880221968919846435
Need a hint?
When p and q are very close, n is almost a perfect square. Look up Fermat's factorization method (or try factordb.com).