Slashdot Mirror

← Back to Stories (view on slashdot.org)

The End of Encryption?

Posted by michael on from the doom-and-gloom dept.

An anonymous reader writes "The encryption algorithms that make virtually all electronic commerce possible work only because certain mathematical problems are very, very hard to solve. But some mathematicians are trying to prove that there's really no difference between 'hard' and 'not hard' problems--known in the math biz as P and NP. In an article on TechnologyReview.com, Simson Garfinkel spells out the real-world consequences of this mathematical conundrum."

4 of 633 comments (clear)

  1. First time I read... by gracenix · · Score: 0, Redundant

    thought it said Simon n Garfunkel

  2. Re:Ha! by platinumflame · · Score: 0, Redundant

    87% of all statistics are made up on the spot...

  3. Re:Didn't that guy... by Anubis350 · · Score: 0, Redundant

    or "Patterns", wait.....

    --
    "goodbye and hello, as always" ~Prince Corwin, from Zelazny's Amber series
  4. Re:Nope, wrong, invalid.. nothing to see here. by Surt · · Score: 0, Redundant

    So when it's down to Alice and Bob, Bob can leave his diary unlocked?

    --
    "Who is the Journal of Quantum Physics going to believe?" --Stephen Hawking