53 search results - page 5 / 11 » How to Hash into Elliptic Curves |
CORR
2004
Springer
13 years 8 months ago
2004
Springer
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...
DCC
2007
IEEE
14 years 8 months ago
2007
IEEE
Abstract. We present a general technique for the efficient computation of pairings on supersingular Abelian varieties. This formulation, which we call the eta pairing, generalises ...
ANTS
2008
Springer
13 years 10 months ago
2008
Springer
Let K be a p-adic local field and E an elliptic curve defined over K. The component group of E is the group E(K)/E0(K), where E0(K) denotes the subgroup of points of good reduction...
IACR
2011
12 years 8 months ago
2011
Abstract. The Gallant-Lambert-Vanstone (GLV) method is a very ef cient technique for accelerating point multiplication on elliptic curves with e ciently computable endomorphisms. G...
CRYPTO
2004
Springer
14 years 1 months ago
2004
Springer
Pairing-based cryptosystems rely on bilinear non-degenerate maps called pairings, such as the Tate and Weil pairings defined over certain elliptic curve groups. In this paper we s...