Computing bilinear pairings on elliptic curves with automorphisms
From MaRDI portal
Publication:629880
DOI10.1007/s10623-010-9383-yzbMath1210.14033OpenAlexW1978702520MaRDI QIDQ629880
Dongqing Xie, Jingwei Zhang, Fangguo Zhang, Chang-An Zhao, Bing-Long Chen
Publication date: 10 March 2011
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-010-9383-y
Cryptography (94A60) Elliptic curves (14H52) Curves over finite and local fields (11G20) Computational aspects of algebraic curves (14Q05)
Related Items
Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree ⋮ Self-pairings on supersingular elliptic curves with embedding degree \textit{three} ⋮ Efficient Self-pairing on Ordinary Elliptic Curves ⋮ A Digital Signature Scheme Based on Two Hard Problems ⋮ Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing pairings using \(x\)-coordinates only
- On the relationship between squared pairings and plain pairings
- The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
- The Magma algebra system. I: The user language
- The Weil pairing, and its efficient calculation
- Counting points on elliptic curves over finite fields
- Efficient pairing computation on supersingular abelian varieties
- The Eta Pairing Revisited
- Pairing Lattices
- Efficient and Generalized Pairing Computation on Abelian Varieties
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Optimised Versions of the Ate and Twisted Ate Pairings
- Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
- Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism
- Topics in Cryptology – CT-RSA 2005
- Cryptography and Coding
- Advances in Cryptology - ASIACRYPT 2003
