This project is an implementation of Fermat's factorization method in which multiples of prime numbers are factored into their constituent primes. It is a vanity attempt to break RSA Encryption which relies on the infeasibility of large prime factorization for security.
Run the following command: $ go run primes.go
Run the following command: $ go build primes.go