The Tate Pairing Via Elliptic Nets
From MaRDI portal
Publication:5429249
DOI10.1007/978-3-540-73489-5_19zbMath1151.94570MaRDI QIDQ5429249
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
elliptic curve; Tate pairing; pairing-based cryptography; Miller's algorithm; elliptic divisibility sequence; elliptic net
68W40: Analysis of algorithms
94A60: Cryptography
14Q05: Computational aspects of algebraic curves
14G50: Applications to coding theory and cryptography of arithmetic geometry
Related Items
Unnamed Item, Small scalar multiplication on Weierstrass curves using division polynomials, On symmetries of elliptic nets and valuations of net polynomials, Elliptic nets and elliptic curves, Implementing optimized pairings with elliptic nets, Computing pairings using \(x\)-coordinates only, 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