[Help-gnutls] Diffy-Hellman: Regeneration of prime and primitive root
martin.knappe at gmail.com
Thu Oct 30 13:51:47 CET 2008
I have seen source code examples of servers implementing Diffie Hellman and
noticed that these often regenerate the prime and primitive root used to
generate the shared secret. My questions:
1) Under what conditions is this necessary?
2) Why is this necessary?
3) How to find out the correct interval at which regeneration becomes
Hope someone here can help me...
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Gnutls-help