Generating pairing-friendly elliptic curve parameters using sparse families
The majority of methods for constructing pairing-friendly elliptic curves are based on representing the curve parameters as polynomial families. There are three such types, namely complete, complete with variable discriminant and sparse families. In this paper, we present a method for constructing s...
Main Authors: | Fotiadis Georgios, Konstantinou Elisavet |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2018-06-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/jmc-2017-0024 |
Similar Items
-
A new method of choosing primitive elements for Brezing–Weng families of pairing-friendly elliptic curves
by: Yoon Kisoon
Published: (2015-03-01) -
On the ρ-values of complete families of pairing-friendly elliptic curves
by: Okano Keiji
Published: (2012-12-01) -
Isolated elliptic curves and the MOV attack
by: Scholl Travis
Published: (2017-10-01) -
The review on elliptic curves as cryptographic pairing groups
by: E Khamseh
Published: (2021-05-01) -
Efficient computation of pairings on Jacobi quartic elliptic curves
by: Duquesne Sylvain, et al.
Published: (2014-12-01)