Hacker News new | ask | show | jobs
by muragekibicho 43 days ago
This paper introduces the Galbraith&Ruprai modification to the Gaudry-Schost collision finding algorithm for solving discrete logarithm problems in an interval in (1.36√N) field operations.