Skip to Main content Skip to Navigation
Conference papers

Improved Sieving on Algebraic Curves

Vanessa Vitse 1 Alexandre Wallet 2
2 PolSys - Polynomial Systems
Inria Paris-Rocquencourt, LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : The best algorithms for discrete logarithms in Jacobians of algebraic curves of small genus are based on index calculus methods coupled with large prime variations. For hyperelliptic curves, relations are obtained by looking for reduced divisors with smooth Mumford representation (Gaudry); for non-hyperelliptic curves it is faster to obtain relations using special linear systems of divisors (Diem, Diem and Kochinke). Recently, Sarkar and Singh have proposed a sieving technique, inspired by an earlier work of Joux and Vitse, to speed up the relation search in the hyperelliptic case. We give a new description of this technique, and show that this new formulation applies naturally to the non-hyperelliptic case with or without large prime variations. In particular, we obtain a speed-up by a factor approximately 3 for the relation search in Diem and Kochinke's methods.
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Alexandre Wallet <>
Submitted on : Thursday, September 24, 2015 - 4:36:06 PM
Last modification on : Friday, January 8, 2021 - 5:42:02 PM
Long-term archiving on: : Tuesday, December 29, 2015 - 7:13:34 AM


Files produced by the author(s)



Vanessa Vitse, Alexandre Wallet. Improved Sieving on Algebraic Curves. LATINCRYPT 2015, 4th International Conference on Cryptology and Information Security in Latin America, Aug 2015, Guadalajara, Mexico. pp.295-307, ⟨10.1007/978-3-319-22174-8_16⟩. ⟨hal-01203086⟩



Record views


Files downloads