Sciweavers

Share
ASIACRYPT
2003
Springer

Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curves

11 years 8 months ago
Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curves
One of the recent thrust areas in research on hyperelliptic curve cryptography has been to obtain explicit formulae for performing arithmetic in the Jacobian of such curves. We continue this line of research by obtaining parallel versions of such formulae. Our first contribution is to develop a general methodology for obtaining parallel algorithm of any explicit formula. Any parallel algorithm obtained using our methodology is provably optimal in the number of multiplication rounds. We next apply this methodology to Lange's explicit formula for arithmetic in genus 2 hyperelliptic curve
Pradeep Kumar Mishra, Palash Sarkar
Added 23 Aug 2010
Updated 23 Aug 2010
Type Conference
Year 2003
Where ASIACRYPT
Authors Pradeep Kumar Mishra, Palash Sarkar
Comments (0)
books