+ "P.J. Ponder" <[EMAIL PROTECTED]>:
| There is an interesting article in the New Scientist about attempts to
| prove the Reimann Hypothesis. Alain Connes is one of the people
| mentioned; he's working on a method based on quantum chaos. The article
| doesn't mention cryptography, oddly, among the fields that might be
| effected if the hypothesis is proven.
Um, how might cryptography be affected by the Riemann hypothesis?
Sure, they both have something to do with primes, but that is a rather
tenuous connection, I would think. In particular, I fail to see how a
tight bound on the asymptotic distibution of primes can have any
effect on cryptography.
- Harald
