The End of Encryption?

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."

Comments

Wow - Where is MIT's Fact checker

[MerlynEmrys67]

I am completely befuddled as to how this article could be posted by MIT, wild inaccuracies (several weeks for a 40 bit key ??? how about a few hours for a 56 bit key) and their description of P vs NP is horrible

Note I made absolutely no comment on how this made it into Slashdot - it is poorly written, inflamitory, and accurate enough that a novice in the field will take it as accurate. Perfect for Slashdot