Paper 2004/241 Original: eprint.iacr.org/2004/241 ↗
A Comparison of Point Counting methods for Hyperelliptic Curves over Prime Fields and Fields of Characteristic 2
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.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2004-09-27: last updated
- 2004-09-20: published
- Short URL
- https://ia.cr/2004/241
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2004/241,
author = {Colm O hEigeartaigh},
title = {A Comparison of Point Counting methods for Hyperelliptic Curves over Prime Fields and Fields of Characteristic 2},
howpublished = {Cryptology {ePrint} Archive, Paper 2004/241},
year = {2004},
url = {https://eprint.iacr.org/2004/241}
}