What would you do if you Solved Number theory and the RSA Encryption?

[Nortcele]

Most secure connections use RSA Encryption, one of the Millennium problems is the P vs NP problem.

Say we solve the Problem and we manage to take super-primes and bring them back to there base prime factors, we would be able to decrypt almost all secure connections.

The problem is that we don't know if its actually possible, the RSA/P vs NP problem is a way of finding an algorithm that works for all cases and not only specifics. So far we have managed to crack RSA-768 (786bit) which took years as it is, and that's the brute force method, if we were to find the algorithm we would be able to do each problem in a matter of minutes.

Not to mention the $1,000,000 reward, although that seems fairly small when you think about the things you would have the ability to decrypt.

This is what we have so far,







Some basic references;

http://en.wikipedia.org/wiki/RSA_%28cryptosystem%29
http://en.wikipedia.org/wiki/RSA_Factoring_Challenge
http://en.wikipedia.org/wiki/Quantum_computer
http://blog.computationalcomplexity.org/2004/05/what-if-p-np.html

[Xires]

Donate 90% & pay off debt(less than $30k) with the remaining $100k.  Afterward, we'd probably move(to Seattle), I'd get new dentures, my wife would get the surgery she's been waiting for and I'd start looking for work again with a few new certs.

[p_2001]

P vs NP problem? . I'll keep it a secret.  I will not collect the reward.  P=np problem if solved can make you the ruler of the world.

[loltuna]

I would troll the MTA team by making my own online MTA Lua compiler.

[Nortcele]

Don't know what I would do, probably get it published...