Recommendations
Cited in
(only showing first 100 items - show all)- Pairings for cryptographers
- Computing pairings using x-coordinates only
- On the relationship between squared pairings and plain pairings
- Scalable zero knowledge via cycles of elliptic curves
- Parallelizing pairings on Hessian elliptic curves
- Choosing and generating parameters for pairing implementation on BN curves
- Refinement of the four-dimensional GLV method on elliptic curves
- Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves
- Faster pairing computation on genus 2 hyperelliptic curves
- New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0
- Updating key size estimations for pairings
- Ready-made short basis for GLV+GLS on high degree twisted curves
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- Families of SNARK-friendly 2-chains of elliptic curves
- A taxonomy of pairing-friendly elliptic curves
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
- Beta Weil pairing revisited
- Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves
- Short signatures without random oracles and the SDH assumption in bilinear groups
- A digital signature scheme based on two hard problems
- Side channel attacks against pairing over theta functions
- Faster Ate pairing computation on Selmer's model of elliptic curves
- Faster hashing to \({\mathbb G}_2\)
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
- Generation and Tate pairing computation of ordinary elliptic curves with embedding degree one
- Subgroup security in pairing-based cryptography
- Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography
- Faster explicit formulas for computing pairings over ordinary curves
- Further refinements of Miller's algorithm on Edwards curves
- RNS arithmetic in \(\mathbb F_{p^{k}}\) and application to fast pairing computation
- An analysis of affine coordinates for pairing computation
- Efficient pairing computation on elliptic curves in Hessian form
- Cryptographic pairings based on elliptic nets
- Parallelizing the Weil and Tate pairings
- On the efficient implementation of pairing-based protocols
- Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2
- Attractive subfamilies of BLS curves for implementing high-security pairings
- Computing fixed argument pairings with the elliptic net algorithm
- The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets
- An optimal multiplication algorithm for the \(\eta_T\) pairing over \(F_{3^{6m}}\)
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- Faster Pairings on Special Weierstrass Curves
- Fast Hashing to G 2 on Pairing-Friendly Curves
- Forward-Secure Group Signatures from Pairings
- Pairing computation on Edwards curves with high-degree twists
- Cryptanalysis of pairing-based cryptosystems over small characteristic fields
- On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
- On Compressible Pairings and Their Computation
- Reduction Optimal Trinomials for Efficient Software Implementation of the η T Pairing
- Accelerating twisted Ate pairing with Frobenius map, small scalar multiplication, and multi-pairing
- Pairings in Trusted Computing
- Pairing Lattices
- The Hidden Root Problem
- Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
- Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials
- Integer Variable χ–Based Ate Pairing
- Exponentiation in Pairing-Friendly Groups Using Homomorphisms
- Speeding Up Pairing Computations on Genus 2 Hyperelliptic Curves with Efficiently Computable Automorphisms
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
- Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates
- On Software Parallel Implementation of Cryptographic Pairings
- An efficient residue group multiplication for the \(\eta _{T }\) pairing over \({\mathbb F}_{3^m}\)
- Self-pairings on supersingular elliptic curves with embedding degree \textit{three}
- Implementing the 4-dimensional GLV method on GLS elliptic curves with j-invariant 0
- Optimal pairing computation over families of pairing-friendly elliptic curves
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- The pairing computation on Edwards curves
- Hashing to \(\mathbb{G}_2\) on BLS pairing-friendly curves
- Efficient algorithms for secure outsourcing of bilinear pairings
- On efficient pairings on elliptic curves over extension fields
- Efficient self-pairing on ordinary elliptic curves
- Fixed argument pairing inversion on elliptic curves
- Pairing-based cryptography
- Adequate elliptic curves for computing the product of n pairings
- Eta Pairing Computation on General Divisors over Hyperelliptic Curves y 2 = x 7 − x ±1
- Simplified pairing computation and security implications
- Optimised Versions of the Ate and Twisted Ate Pairings
- Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism
- Algorithmic Number Theory
- Skew Frobenius Map and Efficient Scalar Multiplication for Pairing–Based Cryptography
- Another Approach to Pairing Computation in Edwards Coordinates
- Efficient compression of SIDH public keys
- Pairing inversion via non-degenerate auxiliary pairings
- Constructing symmetric pairings over supersingular elliptic curves with embedding degree three
- Algorithmic Number Theory
- Bilinear pairings on elliptic curves
- Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves
- Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists
- Computing bilinear pairings on elliptic curves with automorphisms
- Secure and Efficient Pairing at 256-Bit Security Level
- Exp function for Edwards curves over local fields
- Biextensions in pairing-based cryptography
- Revisiting pairing-friendly curves with embedding degrees 10 and 14
- Computing pairings on elliptic curves with embedding degree two via biextensions
- A short-list of pairing-friendly curves resistant to the special TNFS algorithm at the 192-bit security level
- Simpler and faster pairings from the Montgomery ladder
- A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties
- Polynomial generating pairing and its criterion for optimal pairing
- A survey of fault attacks in pairing based cryptography
This page was built for publication: The Eta Pairing Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548080)
