[Python/Sage] Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval

Quick Summary

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.

- Here’s 20 dollars to send money abroad.

Here are some free gpu credits if you are coding along.