Cryptographic pairings based on elliptic nets

DOI10.1007/978-3-642-25141-2_5MaRDI QIDQ3097999zbMATH OpenOpenAlexFDO

Authors Naoki Ogura, Naoki Kanayama, Shigenori Uchiyama, Eiji Okamoto

Publication date 10 November 2011

Published in Advances in Information and Computer Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-25141-2_5

zbMATH Keywords

Ate pairingelliptic netnormalizationoptimal pairingR-Ate pairingTate pairing

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Cryptography (94A60)

Recommendations

• The Tate Pairing Via Elliptic Nets
• Implementing optimized pairings with elliptic nets
• Formulae for computation of Tate pairing on hyperelliptic curve using hyperelliptic nets
• The Tate-Lichtenbaum pairing on a hyperelliptic curve via hyperelliptic nets
• Faster explicit formulae for computing pairings via elliptic nets and their parallel computation

Cites work

• Advances in Cryptology - ASIACRYPT 2003
• Cohomology and group extensions in Magma
• Efficient and Generalized Pairing Computation on Abelian Varieties
• Efficient pairing computation on supersingular abelian varieties
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• scientific article; zbMATH DE number 1643939 (Why is no real title available?)
• scientific article; zbMATH DE number 3937328 (Why is no real title available?)
• scientific article; zbMATH DE number 1942431 (Why is no real title available?)
• scientific article; zbMATH DE number 1952905 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• Memoir on Elliptic Divisibility Sequences
• Optimal Pairings
• Pairing-Friendly Elliptic Curves of Prime Order
• The Eta Pairing Revisited
• The Tate Pairing Via Elliptic Nets
• The Weil pairing, and its efficient calculation

Cited in

(5)

• Computing fixed argument pairings with the elliptic net algorithm
• The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets
• The Tate-Lichtenbaum pairing on a hyperelliptic curve via hyperelliptic nets
• Formulae for computation of Tate pairing on hyperelliptic curve using hyperelliptic nets
• Implementing optimized pairings with elliptic nets

This page was built for publication: Cryptographic pairings based on elliptic nets

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