17 Dec
2003
17 Dec
'03
11:17 p.m.
0x7CF5048D wrote:
How do I choose constants suitable for Diffe-Hellman? According to _Applied Cryptography_ n should be prime, also (n-1)/2 should also be prime. g should be a primitive root of unity mod n. n should be 512 or 1024 bits long. Are there any other requirements?
How can I choose such numbers? Are such numbers published anywhere?
Yes, Phil Karn posted a list of such numbers to the list last May, and the program used to generate them. Since some people have expressed their distaste for large files re-posted/forwarded to the list, I won't send it, but you can get it from ftp cs.cmu.edu: /afs/andrew.cmu.edu/usr12/mg5n/public/Karn.DH.generator