11 search results - page 2 / 3 » Computing the Ate Pairing on Elliptic Curves with Embedding ... |
PKC
2010
Springer
13 years 9 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
13 years 11 months ago
2009
Springer
When using pairing-friendly ordinary elliptic curves over prime fields to implement identity-based protocols, there is often a need to hash identities to points on one or both of ...
SACRYPT
2005
Springer
13 years 10 months ago
2005
Springer
Previously known techniques to construct pairing-friendly curves of prime or near-prime order are restricted to embedding degree k 6. More general methods produce curves over Fp wh...
CHES
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. This paper presents a design-space exploration of an applicationspecific instruction-set processor (ASIP) for the computation of various cryptographic pairings over Barre...
PAIRING
2007
Springer
13 years 11 months ago
2007
Springer
We provide the first explicit construction of genus 2 curves over finite fields whose Jacobians are ordinary, have large prime-order subgroups, and have small embedding degree. ...