[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: MODP groups draft concern

In message <10C8636AE359D4119118009027AE9987031A9067@FMSMSX34>, "Walker, Jesse"

>Is computing all 8192/3 = 2731 bit primes within


The Prime Number Theorem states that the number of primes not exceeding 
x is asymptotic to x/log(x).  In this case, that means something close 
to 2^2731/log(2731).  That's a very big number...

		--Steve Bellovin