Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials

DOI10.1007/978-3-540-85538-5_10zbMath1186.94473OpenAlexW1534123842MaRDI QIDQ3600499

Ken Nakamula, Satoru Tanaka

Publication date: 10 February 2009

Published in: Pairing-Based Cryptography – Pairing 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85538-5_10

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

Generating pairing-friendly elliptic curve parameters using sparse families ⋮ Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation ⋮ On Constructing Parameterized Families of Pairing-Friendly Elliptic Curves with $$\rho =1$$ ⋮ On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ Generating Pairing-Friendly Curves with the CM Equation of Degree 1 ⋮ TNFS resistant families of pairing-friendly elliptic curves

Cites Work

• Unnamed Item
• A one round protocol for tripartite Diffie-Hellman
• A taxonomy of pairing-friendly elliptic curves
• Ordinary Abelian varieties having small embedding degree
• Elliptic curves suitable for pairing based cryptography
• Elliptic Curves and Primality Proving
• The Eta Pairing Revisited
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Identity-Based Encryption from the Weil Pairing

This page was built for publication: Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials