48 search results - page 1 / 10 » Computing bilinear pairings on elliptic curves with automorp... |
DCC
2011
IEEE
13 years 5 months ago
2011
IEEE
In this paper, we present a novel method for constructing a super-optimal pairing with great efficiency, which we call the omega pairing. The computation of the omega pairing requi...
IACR
2011
12 years 10 months ago
2011
: Many identity-based digital signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately twenty times higher th...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
Identity Based Encryption (IBE) systems are often constructed using bilinear maps (a.k.a. pairings) on elliptic curves. One exception is an elegant system due to Cocks which build...
EUROCRYPT
2011
Springer
13 years 2 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...
MDAI
2005
Springer
14 years 4 months ago
2005
Springer
The purpose of this paper is to introduce pairing over elliptic curve and apply it to ID based key agreement schemes and privacy preserving key agreement schemes. The key words her...