Welcome to the Slashdot Beta site -- learn more here. Use the link in the footer or click here to return to the Classic version of Slashdot.

Thank you!

Before you choose to head back to the Classic look of the site, we'd appreciate it if you share your thoughts on the Beta; your feedback is what drives our ongoing development.

Beta is different and we value you taking the time to try it out. Please take a look at the changes we've made in Beta and  learn more about it. Thanks for reading, and for making the site better!



Claimed Proof That P != NP

kenryd Re:What would the impacts of this be for cryptogra (457 comments)

Off the top of my head, if P = NP, then a lot of cryptography like RSA and elliptic curve cryptography become, in principle, mathematically solvable. Much of their security is premised on the idea that their equations are prohibitively difficult to brute force because they're NP.

If this proof holds up, then RSA and ECC become provably secure in a way they weren't before.

The security of RSA is based on the idea that it is very difficult to factor large integers. However, this has not been shown to be an NP-hard problem and so really doesn't have anything to do with this.

more than 4 years ago

Slime Mold Could Lead To Better Tech

kenryd No. (179 comments)

The traveling salesman problem is NP-complete, slime molds or not. Under some conditions it can be approximated efficiently, but slime molds are not about to solve the travelling salesman problem in sub-exponential time. In any case, using a computer is much faster than waiting a few days for a slime mold to grow.

more than 4 years ago


kenryd hasn't submitted any stories.


kenryd has no journal entries.

Slashdot Login

Need an Account?

Forgot your password?