Faster pairings on special Weierstrass curves
| Data(s) |
2009
|
|---|---|
| Resumo |
This paper presents efficient formulas for computing cryptographic pairings on the curve y 2 = c x 3 + 1 over fields of large characteristic. We provide examples of pairing-friendly elliptic curves of this form which are of interest for efficient pairing implementations. |
| Formato |
application/pdf |
| Identificador | |
| Publicador |
Springer |
| Relação |
http://eprints.qut.edu.au/27635/1/Faster_pairings_on_special_Weierstrass_curves.pdf DOI:10.1007/978-3-642-03298-1_7 Costello, Craig, Hisil, Huseyin, Boyd, Colin, Gonzalez Nieto, Juan Manuel, & Wong, Kenneth Koon-Ho (2009) Faster pairings on special Weierstrass curves. Lecture Notes in Computer Science, LNCS 5, pp. 89-101. |
| Direitos |
Copyright 2009 Springer Verlag |
| Fonte |
Faculty of Science and Technology; Information Security Institute |
| Palavras-Chave | #Tate pairing #Miller's algorithm #elliptic curves |
| Tipo |
Journal Article |
