# Choice of Primes

- [N is prime](/notes/cryptography/overview/choice-of-primes/n-is-prime.md)
- [Mersenne Primes](/notes/cryptography/overview/choice-of-primes/mersenne-primes.md)
- [P=Q](/notes/cryptography/overview/choice-of-primes/p-q.md)
- [Fermat Factorisation](/notes/cryptography/overview/choice-of-primes/fermat-factorisation.md): Used when p and q are numericaly close