## Solution Overview

Note that primes are occur frequently so the gaps between primes are expected to be relatively small, even between for large primes.
From the code we can approximate the differences of `p` and `q` used for `N`. And with the different `d` where `q = p + d` we can easily derive `p` and `q` from `N`.

__For full implementation and solution see the URL__

Original writeup (https://github.com/pberba/ctf-solutions/tree/master/20181025_bsidesdelhi/crypto-200-rsa_reloaded).