More Discriminants with the Brezing-Weng Method

DOI10.1007/978-3-540-89754-5_30MaRDI QIDQ5504638zbMATH OpenOpenAlexFDO

Authors Gaetan Bisson, Takakazu Satoh

Publication date 22 January 2009

Published in Progress in Cryptology - INDOCRYPT 2008 (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0803.3894

zbMATH Keywords

Brezing-Weng methodpairing-friendly curve generation

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

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.

Recommendations

• Generating Pairing-Friendly Curves with the CM Equation of Degree 1
• A new method of choosing primitive elements for Brezing-Weng families of pairing-friendly elliptic curves
• Constructing pairing-friendly curves with variable CM discriminant
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• On constructing families of pairing-friendly elliptic curves with variable discriminant

Cites work

• A taxonomy of pairing-friendly elliptic curves
• Constructing Isogenies between Elliptic Curves Over Finite Fields
• Die Typen der Multiplikatorenringe elliptischer Funktionenkörper
• Elliptic curves suitable for pairing based cryptography
• scientific article; zbMATH DE number 1643939 (Why is no real title available?)
• scientific article; zbMATH DE number 1131801 (Why is no real title available?)
• scientific article; zbMATH DE number 3221530 (Why is no real title available?)
• Identity-Based Encryption from the Weil Pairing
• ON THE CLASS-NUMBER IN IMAGINARY QUADRATIC FIELDS
• Pairing-Friendly Elliptic Curves of Prime Order
• Reducing elliptic curve logarithms to logarithms in a finite field
• Sur certaines hypothèses concernant les nombres premiers

Cited in

(5)

• Expander graphs based on GRH with an application to elliptic curve cryptography
• A new method of choosing primitive elements for Brezing-Weng families of pairing-friendly elliptic curves
• On constructing families of pairing-friendly elliptic curves with variable discriminant
• Constructing pairing-friendly curves with variable CM discriminant
• Generating Pairing-Friendly Curves with the CM Equation of Degree 1

This page was built for publication: More Discriminants with the Brezing-Weng Method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504638)