论文信息 - Kedlaya's Algorithm in Larger Characteristic

Kedlaya's Algorithm in Larger Characteristic

We show that the linear dependence on $p$ of the running time of Kedlaya's point-counting algorithm in characteristic $p$ may be reduced to $p^{1/2}$.

David Harvey | David Harvey

[1] D. V. Chudnovsky,et al. Approximations and complex multiplication according to Ramanujan , 2000 .

[2] William Stein,et al. Computation of p-Adic Heights and Log Convergence , 2006 .

[3] K. Kedlaya. Counting Points on Hyperelliptic Curves using Monsky-Washnitzer Cohomology , 2001, math/0105031.

[4] V. Strassen. Gaussian elimination is not optimal , 1969 .

[5] Nicolas Gürel,et al. Counting Points in Medium Characteristic Using Kedlaya's Algorithm , 2003, Exp. Math..

[6] David Joyner,et al. SAGE: system for algebra and geometry experimentation , 2005, SIGS.

[7] Tanja Lange,et al. Handbook of Elliptic and Hyperelliptic Curve Cryptography , 2005 .

[8] Éric Schost,et al. Linear Recurrences with Polynomial Coefficients and Computation of the Cartier-Manin Operator on Hyperelliptic Curves , 2003, International Conference on Finite Fields and Applications.

[9] Guillaume Hanrot,et al. The Middle Product Algorithm I , 2004, Applicable Algebra in Engineering, Communication and Computing.

[10] Bas Edixhoven,et al. Point counting after Kedlaya, EIDMA-Stieltjes Graduate course, Leiden, September 22-26, 2003 , 2006 .

[11] Hendrik Hubrechts,et al. Point Counting in Families of Hyperelliptic Curves , 2006, Found. Comput. Math..

[12] Kiran S. Kedlaya,et al. Computing Zeta Functions via p-Adic Cohomology , 2004, ANTS.