Register a SA Forums Account here!
JOINING THE SA FORUMS WILL REMOVE THIS BIG AD, THE ANNOYING UNDERLINED ADS, AND STUPID INTERSTITIAL ADS!!!

You can: log in, read the tech support FAQ, or request your lost password. This dumb message (and those ads) will appear on every screen until you register! Get rid of this crap by registering your own SA Forums Account and joining roughly 150,000 Goons, for the one-time price of $9.95! We charge money because it costs us money per month for bills, and since we don't believe in showing ads to our users, we try to make the money back through forum registrations.
 
  • Post
  • Reply
ScRoTo TuRbOtUrD
Jan 21, 2007

Adbot
ADBOT LOVES YOU

ScRoTo TuRbOtUrD
Jan 21, 2007

human garbage bag posted:

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.

i like this reality you have constructed, where whoever published the article had to do it online out pure logistics. you know, because during live math conferences they were drowned out over the sound of being on sucked for hours on end by calcusluts

ScRoTo TuRbOtUrD
Jan 21, 2007

ClamdestineBoyster posted:

That sounds super op but couldn’t anyone just hold down the 1 key on the keyboard and write to the same memory address until it breaks the prime number cryptography?

you dont even need to press down 1. i spilled my special widecap gatorade bottle on my keyboard and im pretty sure i broke all the prime cryptojiggies

  • 1
  • 2
  • 3
  • 4
  • 5
  • Post
  • Reply