Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

ANTS
2004
Springer

favoriteEmaildiscussreport

114views Algorithms» more ANTS 2004»

Montgomery Scalar Multiplication for Genus 2 Curves

13 years 10 months ago

Montgomery Scalar Multiplication for Genus 2 Curves

Download perso.univ-rennes1.fr

Using powerful tools on genus 2 curves like the Kummer variety, we generalize the Montgomery method for scalar multiplication to the jacobian of these curves. Previously this method was only known for elliptic curves. We obtain an algorithm that is competitive compared to the usual methods of scalar multiplication and that has additional properties such as resistance to timings attacks. This algorithm has very important applications in cryptography using hyperelliptic curves and more particularly for people interested in cryptography on smart cards.

Sylvain Duquesne

Real-time Traffic

Algorithms | ANTS 2004 | Elliptic Curves | Hyperelliptic Curves | Scalar Multiplication |

claim paper

Related Content

» A Compact Architecture for Montgomery Elliptic Curve Scalar Multiplication Processor

» Superscalar Coprocessor for HighSpeed CurveBased Cryptography

» SkewFrobenius Maps on Hyperelliptic Curves

» Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation

» Trading Inversions for Multiplications in Elliptic Curve Cryptography

» A Complete Divisor Class Halving Algorithm for Hyperelliptic Curve Cryptosystems of Genus ...

» Efficient Doubling on Genus 3 Curves over Binary Fields

» A High Performance Reconfigurable Elliptic Curve Processor for GF2m

» The 2Adic CM Method for Genus 2 Curves with Application to Cryptography

Post Info
More Details (n/a)

Added	30 Jun 2010
Updated	30 Jun 2010
Type	Conference
Year	2004
Where	ANTS
Authors	Sylvain Duquesne

Comments (0)