Cryptographic Pairings Based on Elliptic Nets

DOI10.1007/978-3-642-25141-2_5zbMath1344.94068OpenAlexW10629368MaRDI QIDQ3097999

Naoki Ogura, Eiji Okamoto, Naoki Kanayama, Shigenori Uchiyama

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

normalizationTate pairingAte pairingoptimal pairingelliptic netR-Ate pairing

Mathematics Subject Classification ID

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

Related Items (2)

Computing fixed argument pairings with the elliptic net algorithm ⋮ The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Weil pairing, and its efficient calculation
• Efficient pairing computation on supersingular abelian varieties
• Cohomology and group extensions in Magma
• The Eta Pairing Revisited
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Efficient and Generalized Pairing Computation on Abelian Varieties
• Optimal Pairings
• Pairing-Friendly Elliptic Curves of Prime Order
• The Tate Pairing Via Elliptic Nets
• Memoir on Elliptic Divisibility Sequences
• Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: Cryptographic Pairings Based on Elliptic Nets