News for hackers. Stuff that matters.
Re:A Las Vegas algorithm to solve the elliptic curve discret... by hpsineqepsi on Monday April 03, 2017 @06:04PM (#14027644)
This algorithm is slower than existing approaches (Pollard's rho); the ridiculously small "largest group" that the author considered can be easily tackled in a split second with even inefficient general algorithms such as Shank's. It's surprising that such a boring non-result made it to the front page of HN.
Re:A Las Vegas algorithm to solve the elliptic curve discret... by brohee on Monday April 03, 2017 @07:23PM (#14028182)
As I understand it, their implementation is in Sage, which can't really be considered optimized. Is their method inherently slower than Pollard's rho, or is it an implementation issue?
Re:A Las Vegas algorithm to solve the elliptic curve discret... by kafkaesq on Tuesday April 04, 2017 @03:35PM (#14036402)
It's surprising that such a boring non-result

Just because it (currently) only works on a small modulus doesn't make it a "boring non-result". It's the concept that matters.