Artikel
Open Access
On the non-idealness of cyclotomic families of pairing-friendly elliptic curves
-
Min Sha
Veröffentlicht/Copyright:
17. April 2014
Received: 2013-12-4
Revised: 2014-4-6
Accepted: 2014-4-11
Published Online: 2014-4-17
Published in Print: 2014-12-1
© 2014 by De Gruyter
Artikel in diesem Heft
- Frontmatter
- Efficient computation of pairings on Jacobi quartic elliptic curves
- A subexponential construction of graph coloring for multiparty computation
- Quantum computation of discrete logarithms in semigroups
- On the non-idealness of cyclotomic families of pairing-friendly elliptic curves
Schlagwörter für diesen Artikel
Pairing-friendly elliptic curve;
cyclotomic family;
ideal family;
cyclotomic polynomial
Creative Commons
BY-NC-ND 3.0
Artikel in diesem Heft
- Frontmatter
- Efficient computation of pairings on Jacobi quartic elliptic curves
- A subexponential construction of graph coloring for multiparty computation
- Quantum computation of discrete logarithms in semigroups
- On the non-idealness of cyclotomic families of pairing-friendly elliptic curves
