Re: Riemann hypothesis and factoring
From: Bob Silverman (pubkeybreaker_at_aol.comstuff)
Date: 09/10/04
 Next message: Michael Amling: "Re: Any encryption with defined set of output characters available?"
 Previous message: Tom St Denis: "Re: Any encryption with defined set of output characters available?"
 In reply to: David Wagner: "Re: Riemann hypothesis and factoring"
 Next in thread: Tom St Denis: "Re: Riemann hypothesis and factoring"
 Reply: Tom St Denis: "Re: Riemann hypothesis and factoring"
 Reply: David Wagner: "Re: Riemann hypothesis and factoring"
 Reply: Peter Fairbrother: "Re: Riemann hypothesis and factoring"
 Reply: Douglas A. Gwyn: "Re: Riemann hypothesis and factoring"
 Reply: John Savard: "Re: Riemann hypothesis and factoring"
 Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: 10 Sep 2004 01:00:14 GMT
"Yes. But while a proof of RH would likely have little relevance
to crypto, a proof of P!=NP would probably have a lot of relevance to crypto. "
Well if P = NP, then oneway functions do not
exist. Kiss hashing goodbye. Kiss factoring and
discrete logs goodbye. Kiss lattice based
methods goodbye. In fact, kiss all of
public key crypto goodbye...
"You can lead a horse's ass to knowledge, but you can't make him think."
 Next message: Michael Amling: "Re: Any encryption with defined set of output characters available?"
 Previous message: Tom St Denis: "Re: Any encryption with defined set of output characters available?"
 In reply to: David Wagner: "Re: Riemann hypothesis and factoring"
 Next in thread: Tom St Denis: "Re: Riemann hypothesis and factoring"
 Reply: Tom St Denis: "Re: Riemann hypothesis and factoring"
 Reply: David Wagner: "Re: Riemann hypothesis and factoring"
 Reply: Peter Fairbrother: "Re: Riemann hypothesis and factoring"
 Reply: Douglas A. Gwyn: "Re: Riemann hypothesis and factoring"
 Reply: John Savard: "Re: Riemann hypothesis and factoring"
 Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
