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

AAECC

2003

Springer

2003

Springer

Elliptic curve cryptosystems are usually implemented over fields of characteristic two or over (large) prime fields. For large prime fields, projective coordinates are more suitable as they reduce the computational workload in a point multiplication. In this case, choosing for parameter a the value -3 further reduces the workload. Over Fp, not all elliptic curves can be rescaled through isomorphisms to the case a = -3. This paper suggests the use of the more general notion of isogenies to rescale the curve. As a side result, this also illustrates that selecting elliptic curves with a = -3 (as those recommended in most standards) is not restrictive. Keywords. Elliptic curves, scalar multiplication, isogenies, cryptography.

Related Content

Added |
23 Aug 2010 |

Updated |
23 Aug 2010 |

Type |
Conference |

Year |
2003 |

Where |
AAECC |

Authors |
Eric Brier, Marc Joye |

Comments (0)