JSH: Mystery of quiet, P versus NP clue?
- From: proper_unit@xxxxxxxxx
- Date: 2 Jun 2005 10:56:58 -0700
From: jstevh@xxxxxxx
To: Surrogate-Factoring@xxxxxxxxxxxxxxxx
Subject: Mystery of quiet, P versus NP clue?
Date: Thu, 02 Jun 2005 05:31:08 -0700
Message-ID: <1117715468.060470.236220@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>
One of the major mysteries for me has been how it is possible for me to
put up a general solution to
n^2 = m^2 mod T
with all integers, and not get much of a reaction from the math and
cryptography world?
Well there's a clue with the P versus NP problem, as if it is proven
that P=NP then the RSA method is inherently insecure, which is a big
deal.
So what if someone proved that P=NP? Supposedly there's a prize of $1
million US attached:
http://www.claymath.org/millennium/P_vs_NP/
But what if they just didn't acknowledge a solution?
See:
http://www.mail-archive.com/cypherpu...@xxxxxxxxxxx/msg04168.html
I've put up a fuller story at my math blog:
http://mymath.blogspot.com/
It may be one of the biggest stories of the new century--if Anatoly
Plotnikov is correct, and I'm not saying he is, but there is a mystery
here.
First off, his original paper was published in 1996 in SWJPAM, the same
journal that later published a paper of mine, before retracting it:
http://www.emis.de/journals/SWJPAM/vol2-03.html
I put up a link to a site *mirror* as the journal went defunct a few
months after pulling my paper!!!
I have not seen refutations of his paper mentioned on-line.
There is just a lot of quiet on the subject, and I know that simply
ignoring dramatic results is a powerful tool of the math world.
They use it on me and my results.
So why would mathematicians hide results that could shatter the myth of
Internet security?
Well, how much does RSA Corporation make in a year?
How much would they make if P=NP?
There is a lot of motivation here: power and money.
James Harris
.
- Follow-Ups:
- Re: JSH: Mystery of quiet, P versus NP clue?
- From: anzaurres1
- Re: Mystery of quiet, P versus NP clue?
- From: Upchucky
- Re: JSH: Mystery of quiet, P versus NP clue?
- Prev by Date: Re: Cantor and the binary tree
- Next by Date: Re: Simplified SFT algorithm
- Previous by thread: JSH: Sidepoint: f_1 solved for with g_1
- Next by thread: Re: Mystery of quiet, P versus NP clue?
- Index(es):
Relevant Pages
|