[8056] in cryptography@c2.net mail archive
Re: New Scientist article re: the Riemann hypothesis
daemon@ATHENA.MIT.EDU (Harald Hanche-Olsen)
Thu Nov 16 17:20:49 2000
To: cryptography@c2.net
In-Reply-To: <Pine.OSF.4.21.0011141249360.12885-100000@fn3.freenet.tlh.fl.us>
Mime-Version: 1.0
Content-Type: Text/Plain; charset=us-ascii
Content-Transfer-Encoding: 8bit
Message-Id: <20001116164853G.hanche@math.ntnu.no>
Date: Thu, 16 Nov 2000 16:48:53 +0100
From: Harald Hanche-Olsen <hanche@math.ntnu.no>
+ "P.J. Ponder" <ponder@freenet.tlh.fl.us>:
| 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
