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 $\mathbb{F}_{3^n}$. 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 $\mathbb{F}_3$ gives the best results.


Editor(s):
Buell, Duncan
Published in:
Algorithmic Number Theory, 6th International Symposium, ANTS-VI, Burlington, VT, USA, June 13-18, 2004, Proceedings, 223-234
Presented at:
Algorithmic Number Theory, Burlington, VT, USA, June 13-18, 2004
Year:
2004
Publisher:
Springer Berlin Heidelberg
Laboratories:




 Record created 2016-01-19, last modified 2018-03-17

External link:
Download fulltext
URL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)