Hi all
This is the DH mechanism for generating shared secret taken from RFC
2631 (http://tools.ietf.org/html/rfc2631).
I am trying to find out how did they arrive with "q" and "h".
ZZ = (yb ^ xa) mod p = (ya ^ xb) mod p
where ^ denotes exponentiation
ya is party a's public key; ya = g ^ xa mod p
yb is party b's public key; yb = g ^ xb mod p
xa is party a's private key
xb is party b's private key
p is a large prime
q is a large prime
g = h^{(p-1)/q} mod p, where
h is any integer with 1 < h < p-1 such that h{(p-1)/q} mod p > 1
(g has order q mod p; i.e. g^q mod p = 1 if g!=1)
j a large integer such that p=qj + 1
My understanding is that Is "q" and "h" generated individually on party A
and B?
The same is claimed in the following link too.
http://www.ciscopress.com/articles/article.asp?p=24833&seqNum=4
With regards
Kings
_______________________________________________
For more information regarding industry leading CCIE Lab training, please visit
www.ipexpert.com
