Faster pairings on special Weierstrass curves
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.
This is the latest version of this eprint.
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.
Citation countsare sourced monthly fromand citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
Full-text downloadsdisplays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.
|Item Type:||Journal Article|
|Keywords:||Tate pairing, Miller's algorithm, elliptic curves|
|Divisions:||Past > QUT Faculties & Divisions > Faculty of Science and Technology|
Past > Institutes > Information Security Institute
|Copyright Owner:||Copyright 2009 Springer Verlag|
|Deposited On:||30 Sep 2009 07:59|
|Last Modified:||01 Mar 2012 11:09|
Available Versions of this Item
- Faster pairings on special Weierstrass curves. (deposited UNSPECIFIED)
- Faster pairings on special Weierstrass curves. (deposited 30 Sep 2009 07:59)[Currently Displayed]
Repository Staff Only: item control page