6 search results - page 1 / 2 » Faster Explicit Formulas for Computing Pairings over Ordinar... |
EUROCRYPT
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
IACR
2011
12 years 7 months ago
2011
Abstract. This paper proposes new explicit formulae for the point doubling, tripling and addition on ordinary Weierstrass elliptic curves with a point of order 3 over finite fiel...
PKC
2010
Springer
13 years 11 months ago
2010
Springer
Research on efficient pairing implementation has focussed on reducing the loop length and on using high-degree twists. Existence of twists of degree larger than 2 is a very restric...
PAIRING
2009
Springer
14 years 2 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...
ASIACRYPT
2007
Springer
14 years 1 months ago
2007
Springer
Edwards recently introduced a new normal form for elliptic curves. Every elliptic curve over a non-binary field is birationally equivalent to a curve in Edwards form over an exten...