A postscript graph of time to compute keys of various strengths with respect to the size of the group used for the representation.
The slides from the presentation show the assumptions underlying the graph and how the parameters are used in Diffie-Hellman key exchange algorithms.
There is also a tech report on elliptic curve groups and D-H. This is nearly identical to (but predates) our Crypto '95 paper on the same subject.