3 ms·
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
by hpsineqepsi 10y ago
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.
- brohee 10y agoAs 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?
- kafkaesq 10y agoIt'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.