tldr; common factorization methods with quirks:
- close primes: exhaustively search for small params + coppersmith's small roots
- pollard’s p-1: p-1 and q-1 contain big, shared prime which needs to be mixed into the algorithm
- ROCA: that one is exactly as in the paper

Original writeup (https://grosquildu.github.io/crypto/2019/11/10/pwn2win-matRoSkA/).