|
If they broke RSA then they could easily demonstrate it by posting the private key of a random public key found online. Since they didn't it's at most an improvement over the existing best polynomial time algorithm. The funny thing about P=NP is that proving P=NP is as simple as providing just one solution to a big enough problem, but a disproof would probably span an entire book and give the discoverer a harem of math groupies in every university around the world.
|
# ¿ Mar 3, 2021 08:15 |
|
|
# ¿ Apr 25, 2024 21:04 |