48 search results - page 2 / 10 » Computing bilinear pairings on elliptic curves with automorp... |
JSS
2011
12 years 8 months ago
2011
For the last decade, elliptic curve cryptography has gained increasing interest in industry and in the academic community. This is especially due to the high level of security it p...
ICONS
2008
IEEE
13 years 11 months ago
2008
IEEE
DL systems with bilinear structure recently became an important base for cryptographic protocols such as identity-based encryption (IBE). Since the main computational task is the ...
IJNSEC
2008
13 years 5 months ago
2008
Identity-based cryptography uses pairing functions,which are sophisticated bilinear maps defined on elliptic curves.Computing pairings efficiently in software is presently a relev...
PAIRING
2007
Springer
13 years 11 months ago
2007
Springer
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. The algorithm uses a generalisation of elliptic divisibility sequences known as...
IEICET
2008
13 years 5 months ago
2008
For AES 128 security level there are several natural choices for pairing-friendly elliptic curves. In particular, as we will explain, one might choose curves with k = 9 or curves w...