CryptoDB
Improvement of Th?Leriault Algorithm of Index Calculus for Jacobian of Hyperelliptic Curves of Small Genus
Authors: | |
---|---|
Download: | |
Abstract: | Gaudry present a variation of index calculus attack for solving the DLP in the Jacobian of hyperelliptic curves. Harley and Th?Lerialut improve these kind of algorithm. Here, we will present a variation of these kind of algorithm, which is faster than previous ones. Its complexity is $O(2-\frac{2}{g}+\epsilon)$. Recently, P. Gaudry and E. Thom'e http://eprint.iacr.org/2004/153/ present the algorithm, whose complexity is same as our results. So I submit my manuscript to this eprint archive. |
BibTeX
@misc{eprint-2004-12133, title={Improvement of Th?Leriault Algorithm of Index Calculus for Jacobian of Hyperelliptic Curves of Small Genus}, booktitle={IACR Eprint archive}, keywords={public-key cryptography / Index calculus attack, Jacobian, Hyperelliptic curve, DLP}, url={http://eprint.iacr.org/2004/161}, note={ nagao@kanto-gakuin.ac.jp 12608 received 8 Jul 2004}, author={Ko-ichi Nagao}, year=2004 }