{"repository":{"description":"A python implementation of the well know method of two parties anonymously exchanging cryptographic keys over an insecure connection. The Diffie-Hellman key exchange uses the mathematical properties of prime numbers (the fact that it cannot be reduced by factors, and that there isn't an effective mathematical method of deducing prime factors from the multiple of two large prime numbers) and the modulus function to reach the same result from two distinct functions using the result from the other persons secret. The individual secrets are them computed to return a \"shared secret\", a secret that both know.","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":0,"owner":"rend0g","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"created_at":"2013-06-17T19:14:05-07:00","pushed_at":"2013-06-17T19:14:05-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Jack Renshaw","company":"Alternetz","blog":"https://alternetz.com","location":"Sydney, Australia","email":"fac4e19b50261fa250cd3a2580038b5ef6b2dcca@outlook.com"},"url":"https://github.com/rend0g/Diffie-Hellman"}