International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

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

Authors:
Colm O hEigeartaigh
Download:
URL: http://eprint.iacr.org/2004/241
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2004-12210,
  title={A Comparison of Point Counting methods for Hyperelliptic Curves over Prime Fields and Fields of Characteristic 2},
  booktitle={IACR Eprint archive},
  keywords={Hyperelliptic Curve Cryptography, lattices, point counting, Jacobian},
  url={http://eprint.iacr.org/2004/241},
  note={ coheigeartaigh@computing.dcu.ie 12688 received 17 Sep 2004, last revised 27 Sep 2004},
  author={Colm O hEigeartaigh},
  year=2004
}