Loading...
conference paper
Function Field Sieve in Characteristic Three
2004
Algorithmic Number Theory, 6th International Symposium, ANTS-VI, Burlington, VT, USA, June 13-18, 2004, Proceedings
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.
Use this identifier to reference this record
Type
conference paper
Authors
Editors
Buell, Duncan
Publication date
2004
Publisher
Published in
Algorithmic Number Theory, 6th International Symposium, ANTS-VI, Burlington, VT, USA, June 13-18, 2004, Proceedings
Series title/Series vol.
Lecture Notes in Computer Science; 3076
Start page
223
End page
234
Peer reviewed
REVIEWED
EPFL units
Event name | Event place | Event date |
Burlington, VT, USA | June 13-18, 2004 | |
Available on Infoscience
January 19, 2016