Solving a 676-Bit Discrete Logarithm Problem in GF(36n)
Solving a 676-Bit Discrete Logarithm Problem in GF(36n) 353 2 Outline of Function Field Sieve In this section, we describe an overview of the FFS [1], which consists of four steps: polynomial selection, collect