Point counting on Picard curves in large characteristic

被引:8
|
作者
Bauer, M
Teske, E
Weng, A
机构
[1] Univ Calgary, Dept Math & Stat, Calgary, AB T2N 1N4, Canada
[2] Univ Waterloo, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, Canada
[3] Johannes Gutenberg Univ Mainz, Fachbereich Math, D-55128 Mainz, Germany
关键词
Picard curves;
D O I
10.1090/S0025-5718-05-01758-8
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We present an algorithm for computing the cardinality of the Jacobian of a random Picard curve over a finite field. If the underlying field is a prime field F-p, the algorithm has complexity O(root p).
引用
收藏
页码:1983 / 2005
页数:23
相关论文
共 50 条