Using Cab Curves in the Function Field Sieve
Ryutaroh Matsumoto · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 1999
In Adleman’s Function Field Sieve algorithm solving the discrete logarithm problem in a finite field, it is assumed that a random bivariate polynomial in the certain class is absolutely irreducible with high probability. In this letter we point out that if we use Cab type random polynomials then we always get absolutely irreducible polynomials. We can also simplify the calculation of a product of many rational functions on a curve that belongs to the field of definition by the use of a Cab curve. key words: discrete logarithm problem, function field sieve, Cab curve