Neighbourly Primes
300 points · 0 solved
Someone generated an RSA key by picking a random prime and then the next prime after a small gap. Decrypt the message; the plaintext is the flag as big-endian bytes.
n = 796116608877498743605365723452641852399109122719569499140648385634913641323175740877171494299899
e = 65537
c = 700644058252842201000124878776694820770059254049443408394738382817136577464799574390771573448002Hints0/3