Function Field Sieve in Characteristic Three

In this paper we investigate the efficiency of the function field sieve to compute discrete logarithms in the finite fields F3n . 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 F3 gives the best results.

• Type: Conference
• Year: 2004
• Where: ANTS
• Authors: Robert Granger, Andrew J. Holt, Dan Page, Nigel P. Smart, Frederik Vercauteren
• Keywords: Algorithms, ANTS 2004, Function field Sieve, Identity Based Encryption, Supersingular Elliptic Curves