Abstract
The problem of constructing elliptic curves suitable for pairing applications has received a lot of attention. One of the most general methods to solve this problem is due to Scott. We propose a variant of this method which replaces an exhaustive search with a Gröbner basis calculation. This makes the method potentially able to generate a larger set of families of parameters. We present some new families of parameters for pairing-friendly elliptic curves. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Benits, W. D., & Galbraith, S. D. (2007). Constructing pairing-friendly elliptic curves using Gröbner basis reduction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4887 LNCS, pp. 336–345). https://doi.org/10.1007/978-3-540-77272-9_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
