For DH key agreement, one must begin with a generator of a cyclic group
However, intuitively to me at least, it seems that
g may be expensive to calculate for a random cyclic group mod some large prime
How is this done efficiently on the fly for Diffie Hellman?
Probably this is naive, however it would seem one must check each element of the group to test it's generative properties...