Re: Innovation, my TSP algorithm and factoring, timelines
JSH wrote:
The Internet still uses public key encryption.
Public key encryption does not equal RSA or other factoring. As I've
said before, there's elliptic curve; there are other even more secure
algorithms.
If P=NP, then a polynomial time solution is possible for factoring
meaning that public key encryption is no longer viable as a security
system.
No, it just means you have to keep bumping up key sizes every few years.
I don't have to check it.
You do if you want to claim that it's correct, which you do a lot of.
I'm not doing surrogate factoring further. It's too dangerous.
No, it's not. To suggest otherwise is to demonstrate your ignorance of
computer security.
I, on the other hand, am continuing to popularize my research and can
do things like check Google search results (can you for anything you
do?) as well as look over site statistics for my various web sites.
As I matter of fact, I can. But I'm not going to debase myself to such
pointless comparisons. Suffice to say, I would be willing to hazard that
the work of most posters in this newsgroup could easily outstrip you in
the most important metric, i.e., how many people actually use the product.
--
Beware of bugs in the above code; I have only proved it correct, not
tried it. -- Donald E. Knuth