14 search results - page 1 / 3 » Endomorphisms for Faster Elliptic Curve Cryptography on a La... |
EUROCRYPT
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Efficiently computable homomorphisms allow elliptic curve point multiplication to be accelerated using the Gallant-Lambert-Vanstone (GLV) method. Iijima, Matsuo, Chao and...
PKC
2004
Springer
13 years 10 months ago
2004
Springer
Let E be an elliptic curve defined over F2n . The inverse operation of point doubling, called point halving, can be done up to three times as fast as doubling. Some authors have t...
PAIRING
2010
Springer
13 years 2 months ago
2010
Springer
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He points out that pairing implem...
ANTS
2010
Springer
13 years 8 months ago
2010
Springer
An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between ellip...
PAIRING
2009
Springer
13 years 11 months ago
2009
Springer
This paper presents efficient formulas for computing cryptographic pairings on the curve y2 = cx3 + 1 over fields of large characteristic. We provide examples of pairing-friendly...