Journal article icon

Journal article

Computing zeta functions of Kummer curves via multiplicative characters

Abstract:

We present a practical polynomial-time algorithm for computing the zeta function of a Kummer curve over a finite field of small characteristic. Such algorithms have recently been obtained using a method of Kedlaya based upon Monsky-Washnitzer cohomology, and are of interest in cryptography. We take a different approach. The problem is reduced to that of computing the L-function of a multiplicative character sum. This latter task is achieved via a cohomological formula based upon the work of D...

Expand abstract

Actions


Access Document


Publisher copy:
10.1007/s10208-002-0066-6

Authors


Lauder, AGB More by this author
Journal:
Foundations of Computational Mathematics
Volume:
3
Issue:
3
Pages:
273-295
Publication date:
2003
DOI:
EISSN:
1615-3383
ISSN:
1615-3375
URN:
uuid:1e14b590-1228-4ae7-b4eb-8b8619265853
Source identifiers:
147873
Local pid:
pubs:147873

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP