Constructing pairing-friendly elliptic curves using factorization of cyclotomic polynomials

16Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The problem of constructing pairing-friendly elliptic curves has received a lot of attention. To find a suitable field for the construction we propose a method to find a polynomial u(x), by the method of indeterminate coefficients, such that Φ k (u(x)) factors. We also refine the algorithm by Brezing and Weng using a factor of Φ k (u(x)). As a result, we produce new families of parameters using our algorithm for pairing-friendly elliptic curves with embedding degree 8, and we compute some explicit curves as numerical examples. © Springer-Verlag Berlin Heidelberg 2008.

Cite

CITATION STYLE

APA

Tanaka, S., & Nakamula, K. (2008). Constructing pairing-friendly elliptic curves using factorization of cyclotomic polynomials. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5209 LNCS, pp. 136–145). https://doi.org/10.1007/978-3-540-85538-5_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free