You are looking at a specific version 20040927:122629 of this paper. See the latest version.

Paper 2004/241

A Comparison of Point Counting methods for Hyperelliptic Curves over Prime Fields and Fields of Characteristic 2

Colm O hEigeartaigh

Abstract

Computing the order of the Jacobian of a hyperelliptic curve remains a hard problem. It is usually essential to calculate the order of the Jacobian to prevent certain sub-exponential attacks on the cryptosystem. This paper reports on the viability of implementations of various point-counting techniques. We also report on the scalability of the algorithms as the fields grow larger.

Note: Faulty submission title

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Unknown where it was published
Keywords
Hyperelliptic Curve Cryptographylatticespoint countingJacobian
Contact author(s)
coheigeartaigh @ computing dcu ie
History
2004-09-27: revised
2004-09-20: received
See all versions
Short URL
https://ia.cr/2004/241
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.