Perplexing proof

[Sarad AV]

--- "Major Variola (ret)" <mv at cdc.gov> wrote:

> Can someone explain how finding regularity in the
> distribution of primes
> 
> would affect any modexp() system?   Suppose that you
> have a function
> F(i) which gives you the i-th prime.  Since the PK
> systems (eg RSA, DH)
> use *randomness* to pick primes, how does being able
> to generate
> the i-th prime help?


It doesn't affect security of RSA. It only speeds up
primality testing.

Sarath.



		
__________________________________
Do you Yahoo!?
New and Improved Yahoo! Mail - Send 10MB messages!
http://promotions.yahoo.com/new_mail