Efficient computation of pairings on Jacobi quartic elliptic curves

DOI10.1515/JMC-2013-0033zbMATH Open1311.14032OpenAlexW2050216354MaRDI QIDQ490338FDOQ490338

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

Recommendations

• An optimal Tate pairing computation using Jacobi quartic elliptic curves
• Efficient pairing computation on elliptic curves in Hessian form
• Tate pairing computation on Jacobi's elliptic curves
• On efficient pairings on elliptic curves over extension fields
• Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2
• Information Security and Privacy
• Fast Tate pairing computation on twisted Jacobi intersections curves
• Public Key Cryptography – PKC 2004
• Efficiently computable complex multiplication of elliptic curves
• scientific article; zbMATH DE number 1962162

zbMATH Keywords

computationAte pairingTate pairingtwistsJacobi quartic curvesMiller algorithm

Mathematics Subject Classification ID

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

Cited In (7)

• An optimal Tate pairing computation using Jacobi quartic elliptic curves
• Jacobi Quartic Curves Revisited
• Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2
• Title not available (Why is that?)
• Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
• Efficient pairing computation on supersingular abelian varieties
• Parallelizing pairings on Hessian elliptic curves

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

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