Re: Diffie-Helman example in g++

[cman@IO.COM (Douglas Barnes)]

> The only restriction placed on /a/ is that it be a primitive root of
> /p/. To do this, you choose /a/ at random until you find the condition
> (/a/, /p/-1) == 1 is satisfied. Since there are lots of primitive roots,
> this shouldn't take long. I wonder though, are there any strengths in
> choosing higher values of /a/?
> 
> Feel free to correct me if I'm wrong, my engineering background means
> my number theory isn't as strong as it could be (but I'm working on it
> :-).
> 

a is a constant, known to all (especially to both A and B).

Doug

-- 
----------------                                             /\ 
Douglas Barnes            cman@illuminati.io.com            /  \ 
Chief Wizard         (512) 448-8950 (d), 447-7866 (v)      / () \
Illuminati Online          metaverse.io.com 7777          /______\