Cryptology ePrint Archive: Report 2014/815

A New Method for Decomposition in the Jacobian of Small Genus Hyperelliptic Curves

Palash Sarkar and Shashank Singh

Abstract: Decomposing a divisor over a suitable factor basis in the Jacobian of a hyperelliptic curve is a crucial step in an index calculus algorithm for the discrete log problem in the Jacobian. For small genus curves, in the year 2000, Gaudry had proposed a suitable factor basis and a decomposition method. In this work, we provide a new method for decomposition over the same factor basis. The advantage of the new method is that it admits a sieving technique which removes smoothness checking of polynomials required in Gaudry's method. Also, the total number of additions in the Jacobian required by the new method is less than that required by Gaudry's method. The new method itself is quite simple and we present some example decompositions and timing results of our implementation of the method using Magma.

Category / Keywords: foundations / hyperelliptic curves, index calculus method, decomposition, sieving

Date: received 8 Oct 2014, last revised 30 Dec 2014

Contact author: palash at isical ac in

Available format(s): PDF | BibTeX Citation

Note: Updated timing details and added timing comparison to Gaudry's method.

Version: 20141230:105554 (All versions of this report)

Short URL: ia.cr/2014/815

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]