On constructing families of pairing-friendly elliptic curves with variable discriminant

  • Authors:
  • Robert Dryło

  • Affiliations:
  • Institute of Mathematics, Polish Academy of Sciences, Warszawa, Poland

  • Venue:
  • INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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].