Title: An extension of Kedlaya's algorithm to Artin-Schreier curves in characteristic 2
Authors: Denef, Jan
Vercauteren, Fr├ęderik
Issue Date: 2002
Publisher: Springer-Verlag
Host Document: Lecture Notes in Computer Science vol:2369 pages:308-323
Conference: ANTS 2002 date:July 07-12, 2002
Abstract: In this paper we present an extension of Kedlaya's algorithm for computing the zeta function of an Artin-Schreier curve over a finite field F-q of characteristic 2. The algorithm has running time O(g(5+epsilon) log(3+epsilon) q) and needs O(g(3) log(3) q) storage space for a genus g curve. Our first implementation in MAGMA shows that one can now generate hyperelliptic curves suitable for cryptography in reasonable time. We also compare our algorithm with an algorithm by Lauder and Wan which has the same time and space complexity. Furthermore, the method introduced in this paper can be used for any hyperelliptic curve over a finite field of characteristic 2.
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Algebra Section
ESAT - STADIUS, Stadius Centre for Dynamical Systems, Signal Processing and Data Analytics

Files in This Item:
File Status SizeFormat
article-426.pdf Published 268KbAdobe PDFView/Open Request a copy

These files are only available to some KU Leuven Association staff members


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science