Computing fixed argument pairings with the elliptic net algorithm

DOI10.14495/JSIAML.6.69MaRDI QIDQ3121365zbMATH OpenOpenAlexFDO

Authors Yang Liu, Naoki Kanayama, Kazutaka Saito, Tadanori Teruya, Shigenori Uchiyama, Eiji Okamoto

Publication date 18 March 2019

Published in JSIAM Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14495/jsiaml.6.69

zbMATH Keywords

elliptic net algorithmfixed argument pairingpairing-based cryptography

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Recommendations

• Fixed argument pairings
• Cryptographic pairings based on elliptic nets
• The realm of the pairings
• The Tate Pairing Via Elliptic Nets
• Faster explicit formulae for computing pairings via elliptic nets and their parallel computation

Cites work

• Cryptographic pairings based on elliptic nets
• Efficient and Generalized Pairing Computation on Abelian Varieties
• Efficient pairing computation on supersingular abelian varieties
• Fixed argument pairings
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• Optimal Pairings
• The Eta Pairing Revisited
• The Tate Pairing Via Elliptic Nets
• The Weil pairing, and its efficient calculation

Cited in

(2)

• An Improvement of the Elliptic Net Algorithm
• Fixed argument pairings

This page was built for publication: Computing fixed argument pairings with the elliptic net algorithm

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