Abstract
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. © 2009 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
APA
Costello, C., Hisil, H., Boyd, C., Gonzalez Nieto, J., & Wong, K. K. H. (2009). Faster pairings on special weierstrass curves. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5671 LNCS, pp. 89–101). https://doi.org/10.1007/978-3-642-03298-1_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free