{"repository":{"description":"Prime factorization is known as a way to crack the RSA cryptosystem code. Currently, most of the best modern factoring algorithms are based on the idea behind Fermat's method of factorization. This project explain how to use Fermat's method  to find the prime factorization of a number.","homepage":"","watchers":1,"stargazers":1,"forks":1,"fork":false,"size":524,"owner":"eduardolundgren","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"Java","created_at":"2010-05-25T11:21:21-07:00","pushed_at":"2010-05-25T11:30:19-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Anatoly Korniltsev","blog":"korniltsev.ru","email":"e5125a32fc3ae69720b1e1b50084e40ca645657e@gmail.com"},"url":"https://github.com/kurganec/rsa-prime-factorization"}