Article
Open Access
Efficient computation of pairings on Jacobi quartic elliptic curves
-
Sylvain Duquesne
,
Nadia El Mrabet
Published/Copyright:
July 11, 2014
Received: 2013-9-16
Revised: 2014-4-22
Accepted: 2014-7-3
Published Online: 2014-7-11
Published in Print: 2014-12-1
© 2014 by De Gruyter
Articles in the same Issue
- 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
Creative Commons
BY-NC-ND 3.0
Articles in the same Issue
- 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
