In [10] Freeman, Scott and Teske consider three types of families: complete, sparse and complete with variable discriminant. A general method for constructing complete families is due to Brezing and Weng. In this note we generalize this method to construct families of the latter two types. As an application, we find variable-discriminant families for a few embedding degrees, which improve the previous best ρ-values of families given in [10]. © 2011 Springer-Verlag.
CITATION STYLE
Dryło, R. (2011). On constructing families of pairing-friendly elliptic curves with variable discriminant. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7107 LNCS, pp. 310–319). https://doi.org/10.1007/978-3-642-25578-6_22
Mendeley helps you to discover research relevant for your work.