Efficient computation of pairings on Jacobi quartic elliptic curves

DOI10.1515/JMC-2013-0033zbMath1311.14032OpenAlexW2050216354MaRDI QIDQ490338

Emmanuel Fouotsa, Sylvain Duquesne, Nadia El Mrabet

Publication date: 22 January 2015

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2013-0033

zbMATH Keywords

computationtwistsTate pairingAte pairingJacobi quartic curvesMiller algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Cryptography (94A60) Elliptic curves (14H52) Curves over finite and local fields (11G20)

Related Items (3)

Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation ⋮ Parallelizing pairings on Hessian elliptic curves ⋮ An optimal Tate pairing computation using Jacobi quartic elliptic curves

This page was built for publication: Efficient computation of pairings on Jacobi quartic elliptic curves