[EMAIL PROTECTED]([EMAIL PROTECTED])@Fri, Sep 15, 2006 at 03:31:29PM -0700: > > There is a famous outstanding problem in computer science that relates > to this. If you can solve it then the Clay Institute has committed > to paying your ONE MILLION dollars! > > It is called the "P != NP" problem. > > Strangely enough, most everyone *believes* RSA, elliptical crypto, > etc. are hard to crack but no has been able to *prove* they > cannot be solved with a polynomial time algorithm. >
Strangely? Doesn't sound strange to me. ;-) If no one has been *able* to prove that they *can't* be proved by those poly-globular time-travel algorithms, then it follows that no one has been *able* to prove that they *can* be. If they haven't been *able*, I have to assume it is because it's hard. So far, I believe it's hard to crack. ;-) Wade Curry syntaxman -- [email protected] http://www.kernel-panic.org/cgi-bin/mailman/listinfo/kplug-list
