Announcing: Slashdot Deals - Explore geek apps, games, gadgets and more. (what is this?)

Thank you!

We are sorry to see you leave - Beta is different and we value the time you took to try it out. Before you decide to go, please take a look at some value-adds for Beta and learn more about it. Thank you for reading Slashdot, 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.

about 5 years ago


kenryd hasn't submitted any stories.


kenryd has no journal entries.

Slashdot Login

Need an Account?

Forgot your password?