The Tate Pairing Via Elliptic Nets

DOI10.1007/978-3-540-73489-5_19zbMath1151.94570OpenAlexW1482385240MaRDI QIDQ5429249

Katherine E. Stange

Publication date: 29 November 2007

Published in: Pairing-Based Cryptography – Pairing 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73489-5_19

zbMATH Keywords

elliptic curveTate pairingpairing-based cryptographyMiller's algorithmelliptic divisibility sequenceelliptic net

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Cryptography (94A60) Computational aspects of algebraic curves (14Q05) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (13)

Small scalar multiplication on Weierstrass curves using division polynomials ⋮ ALGEBRAIC DIVISIBILITY SEQUENCES OVER FUNCTION FIELDS ⋮ Implementing optimized pairings with elliptic nets ⋮ PERFECT POWERS IN PRODUCTS OF TERMS OF ELLIPTIC DIVISIBILITY SEQUENCES ⋮ Elliptic nets and elliptic curves ⋮ On symmetries of elliptic nets and valuations of net polynomials ⋮ Unnamed Item ⋮ Computing pairings using \(x\)-coordinates only ⋮ The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences ⋮ Cryptographic Pairings Based on Elliptic Nets ⋮ Primitive divisors of sequences associated to elliptic curves over function fields ⋮ Computing fixed argument pairings with the elliptic net algorithm ⋮ The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets

This page was built for publication: The Tate Pairing Via Elliptic Nets