search

stillson / scom

simple secure communications in python
BSD 2-Clause "Simplified" License
0 stars 0 forks source link

fix DH prime and generator code #1

Open stillson opened 8 years ago

stillson commented 8 years ago

It's ok, but with a little research (handbook of applied cryptography) it seems the code could be better

2n+1 prime, possible better generator determination

stillson commented 8 years ago

fixed, uses 2n+1 primes ( p = 2n+1 where n is also prime) Still needs a decent way of generating primes asynchronously could I use the same prime for a while, but change the generator?