Constructing pairing-friendly curves with variable CM discriminant

DOI10.4134/BKMS.2012.49.1.075MaRDI QIDQ3224984zbMATH OpenOpenAlexFDO

Authors Hyang-Sook Lee, Cheol-Min Park

Publication date 13 March 2012

Published in Bulletin of the Korean Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4134/bkms.2012.49.1.075

zbMATH Keywords

CM discriminantelliptic curvespairing-friendly curves

Mathematics Subject Classification ID

Curves over finite and local fields (11G20) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Finite ground fields in algebraic geometry (14G15) Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)

Recommendations

• On constructing families of pairing-friendly elliptic curves with variable discriminant
• Generating Pairing-Friendly Curves with the CM Equation of Degree 1
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials
• More Discriminants with the Brezing-Weng Method

Cited in

(6)

• Generating pairing-friendly elliptic curve parameters using sparse families
• TNFS resistant families of pairing-friendly elliptic curves
• On constructing families of pairing-friendly elliptic curves with variable discriminant
• Generating Pairing-Friendly Curves with the CM Equation of Degree 1
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• More Discriminants with the Brezing-Weng Method

Describes a project that uses

Uses Software

• Magma

This page was built for publication: Constructing pairing-friendly curves with variable CM discriminant

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