Compressed pairings
From MaRDI portal
Recommendations
Cited in
(23)- Computing pairings using x-coordinates only
- Compressions of compact tuples
- Choosing and generating parameters for pairing implementation on BN curves
- Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree
- A taxonomy of pairing-friendly elliptic curves
- Improving the computation of the optimal ate pairing for a high security level
- Efficient pairing computation on supersingular abelian varieties
- On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings
- Effective compression maps for torus-based cryptography
- Memory-saving computation of the pairing final exponentiation on BN curves
- Exponentiating in pairing groups
- Attractive subfamilies of BLS curves for implementing high-security pairings
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- Selecting Complementary Pairs of Literals
- On Compressible Pairings and Their Computation
- Factor-4 and 6 compression of cyclotomic subgroups of \(\mathbb F^*_{2^{4m}}\) and \(\mathbb F^*_{3^{6m}}\)
- Pairing Lattices
- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
- Compression of Tate pairings on elliptic curves
- Factor-4 and 6 (De)Compression for Values of Pairings Using Trace Maps
- Compressed M-SIDH: an instance of compressed SIDH-like schemes with isogenies of highly composite degrees
- Effective pairings in isogeny-based cryptography
- Computing pairings on elliptic curves with embedding degree two via biextensions
This page was built for publication: Compressed pairings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311564)