Fast Primes
The primes are generated using the primorial and the sieve. This is known to be ROCA, the vulnerability CVE-2017-15361. More details can be found at this link. This article is also a great start for understanding a bit of Coppersmith-Howgrave method for finding roots of polynomial.
Again, an unintended solution is the fact that we can use FactorDB for a quick hack at the factorisation.
Python Implementation:
from Crypto.PublicKey import RSA from Crypto.