EPFL breaks Internet Security Candidate Discrete Logarithms Encryption in Two Hours

It is challenging even for experts to grasp the computational power now available to students and researchers. EPFL researchers decrypted a candidate for the Internet’s future security systems based on “discrete logarithms“. Allegedly tamper-proof, it could only stand up to the school machines’ decryption attempts for two hours.

More information: Robert Granger, Thorsten Kleinjung, Jens Zumbrägel. “Breaking `128-bit Secure’ Supersingular Binary Curves (or how to solve discrete logarithms in F24⋅1223 and F212⋅367).” arXiv:1402.3668. arxiv.org/abs/1402.3668

Read more at: http://phys.org/news/2014-05-unassailable-encryption-algorithm-hours.html#jCp