The Tate Pairing Via Elliptic Nets

DOI10.1007/978-3-540-73489-5_19MaRDI QIDQ5429249zbMATH OpenOpenAlexFDO

Authors 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 curveelliptic divisibility sequenceelliptic netMiller's algorithmpairing-based cryptographyTate pairing

Mathematics Subject Classification ID

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

Recommendations

• The Tate-Lichtenbaum pairing on a hyperelliptic curve via hyperelliptic nets
• Formulae for computation of Tate pairing on hyperelliptic curve using hyperelliptic nets
• Tate pairing computation on Jacobi's elliptic curves
• The Tate pairing for abelian varieties over finite fields
• scientific article; zbMATH DE number 5532059
• scientific article; zbMATH DE number 2164181
• A note on the Tate pairing of curves over finite fields
• A multilinear generalization of the Tate pairing
• Elliptic nets and elliptic curves
• A generalisation of the Cassel-Tate pairing.

Cited in

(22)

• Computing pairings using x-coordinates only
• The Weil pairing, and its efficient calculation
• Faster explicit formulae for computing pairings via elliptic nets and their parallel computation
• Primitive divisors of sequences associated to elliptic curves over function fields
• Algebraic divisibility sequences over function fields
• Perfect powers in products of terms of elliptic divisibility sequences
• Cryptographic pairings based on elliptic nets
• Computing fixed argument pairings with the elliptic net algorithm
• The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets
• The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences
• The Tate-Lichtenbaum pairing on a hyperelliptic curve via hyperelliptic nets
• On symmetries of elliptic nets and valuations of net polynomials
• Formulae for computation of Tate pairing on hyperelliptic curve using hyperelliptic nets
• Small scalar multiplication on Weierstrass curves using division polynomials
• scientific article; zbMATH DE number 7640040 (Why is no real title available?)
• Elliptic nets and elliptic curves
• Effective pairings in isogeny-based cryptography
• The Tate profile
• Biextensions in pairing-based cryptography
• Computing pairings on elliptic curves with embedding degree two via biextensions
• Simpler and faster pairings from the Montgomery ladder
• Implementing optimized pairings with elliptic nets

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

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