In New Scientist Breaking News - Classic maths puzzle cracked at last the article discusses a breakthrough in congruence mathematics. At the end of the article, it mentions applicability to cryptographic algorithms currently in use on the Internet, and I am assuming that applicability is meant for the prime number algorithms used in public key cryptography. Already, weaknessed in SHA are showing up (well, after 30+ years). Combined with this, are we set to weather a new storm of cryptographic attacks on the underlying security of the 'net?
The article isn't clear, however, as to the applicability toward prime number computation. If any of you reading this know where I can get more information on the new discovery, or a laymen's discussion on its applicability toward public key crypto, please drop a comment and point us in the right direction.
No comments:
Post a Comment