{"push_id":1058725495,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"90def9591c50ed9b285cd96b28cf8e596169ffe3","before":"87643db9e29a485e5b6f10c92e1be84b12d8976e","commits":[{"sha":"90def9591c50ed9b285cd96b28cf8e596169ffe3","author":{"email":"93ef1c66a0da7640f3c97438116dd7e4918e53e0@gmail.com","name":"Johnnyboi42"},"message":"Changed save_primes to start from the biggest exponent currently in primtal.txt, which is a number stored seperately in biggestexponent.txt.\n\nAdded public_key to primtal.py to calculate the public key (n,e).\n\nChanged find_primes2() to return 2 random primes from a bit size with a given range.","distinct":true,"url":"https://api.github.com/repos/Johnnyboi42/Programmering-Eksamensprojekt---RSA/commits/90def9591c50ed9b285cd96b28cf8e596169ffe3"}]}