Faster pairing computations on curves with high-degree twists
From MaRDI portal
Publication:3562898
DOI10.1007/978-3-642-13013-7_14zbMATH Open1279.94069OpenAlexW2114609370MaRDI QIDQ3562898FDOQ3562898
Authors: Craig Costello, Tanja Lange, Michael Naehrig 
Publication date: 28 May 2010
Published in: Public Key Cryptography – PKC 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13013-7_14
Recommendations
Cited In (29)
- On efficient pairings on elliptic curves over extension fields
- Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates
- Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists
- Pairing-friendly twisted Hessian curves
- A formula for disaster: a unified approach to elliptic curve special-point-based attacks
- Faster Ate pairing computation on Selmer's model of elliptic curves
- Choosing and generating parameters for pairing implementation on BN curves
- Speeding up Ate pairing computation in affine coordinates
- Optimised Versions of the Ate and Twisted Ate Pairings
- A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties
- The pairing computation on Edwards curves
- Efficient self-pairing on ordinary elliptic curves
- Further refinements of Miller's algorithm on Edwards curves
- Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition
- Parallelizing the Weil and Tate pairings
- Title not available (Why is that?)
- Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree
- RNS arithmetic in \(\mathbb F_{p^{k}}\) and application to fast pairing computation
- Attractive subfamilies of BLS curves for implementing high-security pairings
- An analysis of affine coordinates for pairing computation
- Families of SNARK-friendly 2-chains of elliptic curves
- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
- Faster computation of the Tate pairing
- Pairing computation on Edwards curves with high-degree twists
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
- Faster Pairings on Special Weierstrass Curves
- Accelerating twisted Ate pairing with Frobenius map, small scalar multiplication, and multi-pairing
- Pairings in rank-1 constraint systems
- Parallelizing pairings on Hessian elliptic curves
Uses Software
This page was built for publication: Faster pairing computations on curves with high-degree twists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3562898)
