Just for reference the algo in it self 128-bit (secure) Supersingular Binary Curves
https://eprint.iacr.org/2014/119.pdf
It's amazing how the paper doesn't look out of reach and can be/or at least partially understood by anyone who is math and crypto literate, a
Topic: Researchers crack unassailable encryption algorithm in two hours (Read 349 times)
What kind of idiot describes an unproven candidate algorithm as "unassailable"? That's not a rhetorical question, either: the article doesn't actually quote anybody as saying any such thing. Unproven algorithms are broken all the time; that's how they're tested. How is this even news? 
Jump to: