Is it true that for a given P & g, I would always get the same public key and for a given P, g & pub_key, I would get the same shared secret key?
Okay, let's get a few terms straight. With Diffie-Hellman, a system shares g, p and each user generates a random secret exponent, x. g^x mod p yields the public exponent. Given any two users whose publice exponents are X & Y, and who share g, p, they may calculate the pairwise shared secret as follows
One party calculates X^y mod p the other calculates Y^x mod p
and thanks to the properties of algebra, these two are the same.
Is that what you mean?
______________________________________________________________________ OpenSSL Project http://www.openssl.org Development Mailing List [EMAIL PROTECTED] Automated List Manager [EMAIL PROTECTED]
