Computing the Tate pairing
From MaRDI portal
Recommendations
Cited in
(24)- Computing pairings using x-coordinates only
- Scalable zero knowledge via cycles of elliptic curves
- Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree
- A taxonomy of pairing-friendly elliptic curves
- Faster computation of the Tate pairing
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- Subgroup security in pairing-based cryptography
- Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography
- An analysis of affine coordinates for pairing computation
- Pairing computation on elliptic curves with efficiently computable endomorphism and small embedding degree
- Efficient pairing computation on curves
- On the efficient implementation of pairing-based protocols
- Efficient Algorithm for Tate Pairing of Composite Order
- Secure and Efficient Group Key Agreements for Cluster Based Networks
- Efficient algorithms for pairing-based cryptosystems
- Efficient computations of the Tate pairing for the large MOV degrees
- Implementing the Tate pairing
- Bilinear pairing computation using the extended double-base chains algorithm
- Adequate elliptic curves for computing the product of n pairings
- scientific article; zbMATH DE number 7746256 (Why is no real title available?)
- Computing bilinear pairings on elliptic curves with automorphisms
- Efficient selective identity-based encryption without random oracles
- Computing pairings on elliptic curves with embedding degree two via biextensions
- Comparing two pairing-based aggregate signature schemes
This page was built for publication: Computing the Tate pairing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710839)