Re: Perplexing proof

At 08:23 AM 9/10/04 -0400, R. A. Hettinga wrote:
work was underlined by recent reports that the Riemann hypothesis, established in 1859, may finally have been proved.
This doesn't follow. details. 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?
Methinks the "expert" du Sautoy is an expert in number theory, not crypto...
Most managers don't understand crypto. This could be an that
security is probably an illusion anyway.
I think this latter indicates the cluelessness of the author.

--- "Major Variola (ret)" <mv@cdc.gov> wrote:
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
participants (2)
-
Major Variola (ret)
-
Sarad AV