J. Denef and F. Vercauteren. An extension of Kedlaya's algorithm to Artin-Schreier curves in characteristic 2. In C. Fieker and D. R. Kohel, editors, Algorithmic Number Theory Symposium, Proceedings ANTS-V, volume 2369 of Lecture Notes in Comp. Sci., pages 308-323. Springer, Berlin, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Computing Zeta Functions of Artin-Schreier Curves over Finite II - Lauder, Wan (2002) (10 citations) (Correct)
....2, which is the main motivation behind the work. Such curves are of interest in cryptography [12] and the fast computation of their Jacobian orders was a long standing open problem, rst resolved for arbitrary genus in a special case in [14] and with no restrictions in the recent work [4, 5]. Unfortunately, we are only able to prove the correctness of our algorithm for the case p 5. We now describe the main theorem. Denote by F q the nite eld with q elements, where q = p and p is prime. Fix F q an algebraic closure of F q , and for each k 1 denote by F q k the unique ....
J. Denef and F. Vercauteren, An extension of Kedlaya's algorithm to Artin-Schreier curves in characteristic 2, to appear in ANTS V, 2002.
Computing Zeta Functions Of Curves Over Finite Fields - Vercauteren (2003) (1 citation) Self-citation (Denef) (Correct)
No context found.
J. Denef and F. Vercauteren. An extension of Kedlaya's algorithm to Artin-Schreier curves in characteristic 2. In C. Fieker and D. R. Kohel, editors, Algorithmic Number Theory Symposium, Proceedings ANTS-V, volume 2369 of Lecture Notes in Comp. Sci., pages 308-323. Springer, Berlin, 2002.
An Extension of Kedlaya's Algorithm to Hyperelliptic Curves .. - Denef, Vercauteren (2004) Self-citation (Denef Vercauteren) (Correct)
No context found.
J. Denef and F. Vercauteren. An extension of Kedlaya's algorithm to Artin-Schreier curves in characteristic 2. In C. Fieker and D.R. Kohel, editors, Algorithmic number theory. 5th international symposium. ANTS-V, volume 2369 of Lecture Notes in Computer Science, pages 308--323, 2002.
Computing Zeta Functions of Hyperelliptic Curves over Finite.. - Vercauteren (2002) (4 citations) Self-citation (Vercauteren) (Correct)
No context found.
J. Denef and F. Vercauteren. An extension of Kedlaya's algorithm to Artin-Schreier curves in characteristic 2. Algorithmic number theory. 5th international symposium. ANTS-V, 2002.
An Extension of Kedlaya's Algorithm to Hyperelliptic Curves .. - Denef, Vercauteren (2002) Self-citation (Denef Vercauteren) (Correct)
No context found.
J. Denef and F. Vercauteren. An extension of Kedlaya's algorithm to Artin-Schreier curves in characteristic 2. In C. Fieker and D.R. Kohel, editors, Algorithmic number theory. 5th international symposium. ANTS-V, volume 2369 of Lecture Notes in Computer Science, pages 308-323. Springer-Verlag Berlin, 2002.
An Extension of Kedlaya's Algorithm to Hyperelliptic Curves .. - Denef, Vercauteren (2002) Self-citation (Denef Vercauteren) (Correct)
....ago. Despite the polynomial time complexity of the Lauder and Wan algorithm, it is not practical for cryptographical sizes. Using Dwork cohomology, Lauder and Wan [19] adapted their original algorithm for the special case of Artin Schreier curves, resulting in an O(g ) time algorithm. In [6], we described an extension of Kedlaya s algorithm to Artin Schreier curves in characteristic 2 which has the same time complexity O(g ) In this paper we extend Kedlaya s algorithm to arbitrary hyperelliptic curves de ned over a nite eld of characteristic 2. For a genus g hyperelliptic ....
J. Denef and F. Vercauteren. An extension of Kedlaya's algorithm to Artin-Schreier curves in characteristic 2. In C. Fieker and D.R. Kohel, editors, Algorithmic number theory. 5th international symposium. ANTS-V, volume 2369 of Lecture Notes in Computer Science, pages 308-323. Springer-Verlag Berlin, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC