Lecture Notes in Computer Science vol:3076 pages:223-234
ANTS 2004 date:June 13-18, 2004
In this paper we investigate the efficiency of the function field sieve to compute discrete logarithms in the finite fields F-3n. Motivated by attacks on identity based encryption systems using supersingular elliptic curves, we pay special attention to the case where n is composite. This allows us to represent the function field over different base fields. Practical experiments appear to show that a function field over F-3 gives the best results.