{"push_id":1450157645,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"e479e13fd587d56eb720b4c1810102c93716c746","before":"561be3d96bab737721b2e6c6384a8cfb0477c3e0","commits":[{"sha":"e479e13fd587d56eb720b4c1810102c93716c746","author":{"name":"Brian Tran","email":"77e89f1cfd05ced5c86d37f235024783a1901c3d@gmail.com"},"message":"Now making sure \"e\" in the RSA algorithm is relatively prime to phi(n). added comments and made sure almost every algorithm is using Big Integers","distinct":true,"url":"https://api.github.com/repos/SnoBoarder/CS789CryptographyProgram/commits/e479e13fd587d56eb720b4c1810102c93716c746"}]}
{"actor":{"display_login":"SnoBoarder"}}