Generation and Tate pairing computation of ordinary elliptic curves with embedding degree one

DOI10.1007/978-3-319-02726-5_28zbMATH Open1346.94105OpenAlexW318170118MaRDI QIDQ2920982FDOQ2920982

Authors: Zhi Hu, Maozhi Xu, Guo-liang Zhang, Lin Wang 

Publication date: 29 September 2014

Published in: Information and Communications Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-02726-5_28

Recommendations

• The Eta Pairing Revisited
• Efficient implementation of pairing-based cryptosystems
• Elliptic curves suitable for pairing based cryptography
• Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2
• Faster explicit formulas for computing pairings over ordinary curves

zbMATH Keywords

complex multiplicationelliptic curvesymmetric pairing

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves over global fields (11G05) Applications to coding theory and cryptography of arithmetic geometry (14G50)

This page was built for publication: Generation and Tate pairing computation of ordinary elliptic curves with embedding degree one

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