Re: Riemann Hypothesis and P vs NP
From: Mok-Kong Shen (mok-kong.shen_at_t-online.de)
Date: 07/05/04
- Next message: BCAL: "Re: Pointless Topology"
- Previous message: Garry Denke: "Garry Denke's Gold & Brass Plates in Westbury White Horse Eye"
- In reply to: Chairman of the Ozzy Osbourne Appreciation Society: "Re: Riemann Hypothesis and P vs NP"
- Next in thread: Jean-Luc Cooke: "Re: Riemann Hypothesis and P vs NP"
- Reply: Jean-Luc Cooke: "Re: Riemann Hypothesis and P vs NP"
- Messages sorted by: [ date ] [ thread ]
Date: Mon, 05 Jul 2004 12:16:29 +0200
Chairman of the Ozzy Osbourne Appreciation Society wrote:
[snip]
> I interpreted the following statement to mean _only_ that if RH is
> true, there is a sure, "fast" way to generate public/private key
> pairs.
>
> "there is a fast way to discover the primes used to build the RSA
> codes on which the security of e-business currently relies."
>
> I can see how his statement can be read to mean that RSA would
> become insecure.
[snip]
This seems to be a rather interesting example of ambiguity
of natural languages which BTW some people, e.g. those in
the politics, are fond of exploiting intentionally.
M. K. Shen
- Next message: BCAL: "Re: Pointless Topology"
- Previous message: Garry Denke: "Garry Denke's Gold & Brass Plates in Westbury White Horse Eye"
- In reply to: Chairman of the Ozzy Osbourne Appreciation Society: "Re: Riemann Hypothesis and P vs NP"
- Next in thread: Jean-Luc Cooke: "Re: Riemann Hypothesis and P vs NP"
- Reply: Jean-Luc Cooke: "Re: Riemann Hypothesis and P vs NP"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|