105 search results - page 4 / 21 » Efficient elliptic curve exponentiation |
EUROCRYPT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In this paper we show that the Ate pairing, originally defined for elliptic curves, generalises to hyperelliptic curves and in fact to arbitrary algebraic curves. It has...
DCC
2007
IEEE
14 years 7 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 ...
TIT
2010
13 years 2 months ago
2010
In this paper we introduce the concept of an optimal pairing, which by definition can be computed using only log2 r/(k) basic Miller iterations, with r the order of the groups invo...
ACISP
2007
Springer
13 years 11 months ago
2007
Springer
This paper presents a new approach to precompute all odd points [3]P, [5]P, . . . , [2k - 1]P, k 2 on an elliptic curve over Fp. Those points are required for the efficient evalua...
IJNSEC
2010
13 years 2 months ago
2010
In 2004, a multi-signature scheme (MSS) based on the elliptic curve cryptosystem is given by Chen et al. [1]. Later, Liu and Liu [6] showed that if one of the users always sends h...