More Discriminants with the Brezing-Weng Method

DOI10.1007/978-3-540-89754-5_30zbMATH Open1203.94094arXiv0803.3894OpenAlexW1653974153MaRDI QIDQ5504638FDOQ5504638

Authors: Gaetan Bisson, Takakazu Satoh 

Publication date: 22 January 2009

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

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.

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

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

zbMATH Keywords

Brezing-Weng methodpairing-friendly curve generation

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

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

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)