DH Primes

http://tools.ietf.org/html/rfc3526

Why does OpenSSL have a specific optimized function for generating DH primes if standard primes for DH use have already been supplied?

>>3 Diffie-hellman? and phi? Am i not on the right topic?

You could use one random prime, and one from the list, and you'd still get P=R*L /// phi ?= (R-1) * (L-1)

//and as long as the list is not too long; if P mod L=0 then P divide L = R... all broken?

...There's only 6 numbers in that RFC ?? and it's using D-H like i thought...

...I must be wrong, that works out to like 3 bit of security...

...Wide-OPEN SSl?

NSA... are you kidding, any old joe could break that (i should stress>) IF i'm correct..

Lets see, it would be equivalent to about six 'normal' ? operations? (average case only 3?)

...unless your op's are so large that as few as six is too much work... (and these are only multiply/divide ops.) in which case it's probably unusable...

There must be (many) more in the list? (there would want to be..)
...Why even use a list at all?