17 search results - page 1 / 4 » Bilinear character sums over elliptic curves |
FFA
2008
13 years 5 months ago
2008
Let k be a finite field with q elements. Let kn be the extension of k with degree n. Let Nn be the kernel of the norm map Nkn/k : k
MDAI
2005
Springer
13 years 10 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...
DCC
2011
IEEE
12 years 12 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 4 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...
CRYPTO
2004
Springer
13 years 10 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...