More Discriminants with the Brezing-Weng Method

Abstract

The Brezing-Weng method is a general framework to generate families of pairing-friendly elliptic curves. Here, we introduce an improvement which can be used to generate more curves with larger discriminants. Apart from the number of curves this yields, it provides an easy way to avoid endomorphism rings with small class number.

References in corpus (1)

• Computing Hilbert Class Polynomials

Cited by in corpus (2)

• Computing the endomorphism ring of an ordinary elliptic curve over a finite field
• Expander graphs based on GRH with an application to elliptic curve cryptography