Function Field Sieve in Characteristic Three

Robert Granger; A. J. Holt; D. Page; N. P. Smart; F. Vercauteren

doi:10.1007/978-3-540-24847-7_16

Back

Function Field Sieve in Characteristic Three

Conference presentation

Peer reviewed

Function Field Sieve in Characteristic Three

Robert Granger, A. J. Holt, D. Page, N. P. Smart and F. Vercauteren

Algorithmic Number Theory, Vol.3076, pp.223-234

Springer, Berlin, Heidelberg

The 6th International Algorithmic Number Theory Symposium (ANTS-VI) (Burlington, VT, USA, 13/06/2004 - 18/06/2004)

13/06/2004

DOI: https://doi.org/10.1007/978-3-540-24847-7_16

Abstract

Elliptic Curve; Elliptic Curf; Discrete Logarithm; Discrete Logarithm Problem; Identity Base Encryption

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₃ gives the best results.

Files and links (1)

url

https://doi.org/10.1007/978-3-540-24847-7_16View

Published (Version of record)

Metrics

25 Record Views

Details

Title: Function Field Sieve in Characteristic Three
Creators: Robert Granger
A. J. Holt
D. Page
N. P. Smart
F. Vercauteren
Publication Details: Algorithmic Number Theory, Vol.3076, pp.223-234
Conference: The 6th International Algorithmic Number Theory Symposium (ANTS-VI) (Burlington, VT, USA, 13/06/2004 - 18/06/2004)
Publisher: Springer, Berlin, Heidelberg
Date published: 13/06/2004
Date submitted: 08/02/2019
Identifiers: 99511992002346
Academic Unit: Department of Computer Science
Resource Type: Conference presentation

Function Field Sieve in Characteristic Three

Abstract

Files and links (1)

Metrics

Details

Usage Policy