The following pages link to The Eta Pairing Revisited (Q3548080):
Displaying 50 items.
- Faster Ate pairing computation on Selmer's model of elliptic curves (Q285904) (← links)
- Further refinements of Miller's algorithm on Edwards curves (Q300877) (← links)
- Self-pairings on supersingular elliptic curves with embedding degree \textit{three} (Q402545) (← links)
- Implementing the 4-dimensional GLV method on GLS elliptic curves with \(j\)-invariant 0 (Q411481) (← links)
- Optimal pairing computation over families of pairing-friendly elliptic curves (Q429764) (← links)
- Endomorphisms for faster elliptic curve cryptography on a large class of curves (Q451123) (← links)
- The pairing computation on Edwards curves (Q460158) (← links)
- Efficient algorithms for secure outsourcing of bilinear pairings (Q476851) (← links)
- Fixed argument pairing inversion on elliptic curves (Q499662) (← links)
- Computing bilinear pairings on elliptic curves with automorphisms (Q629880) (← links)
- A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties (Q741253) (← links)
- Polynomial generating pairing and its criterion for optimal pairing (Q744018) (← links)
- A survey of fault attacks in pairing based cryptography (Q892296) (← links)
- Implementing optimized pairings with elliptic nets (Q893619) (← links)
- Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\) (Q932799) (← links)
- Closed formulae for the Weil pairing inversion (Q938771) (← links)
- Efficient Tate pairing computation using double-base chains (Q954437) (← links)
- Tate and Ate pairings for \(y^2=x^5-\alpha x\) in characteristic five (Q957691) (← links)
- Comparing two pairing-based aggregate signature schemes (Q970534) (← links)
- Pairings for cryptographers (Q1003698) (← links)
- Computing pairings using \(x\)-coordinates only (Q1009121) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- Parallelizing pairings on Hessian elliptic curves (Q1713870) (← links)
- Choosing and generating parameters for pairing implementation on BN curves (Q1745896) (← links)
- Refinement of the four-dimensional GLV method on elliptic curves (Q1746951) (← links)
- Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves (Q1943983) (← links)
- Faster pairing computation on genus \(2\) hyperelliptic curves (Q1944931) (← links)
- New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0 (Q1995209) (← links)
- Updating key size estimations for pairings (Q2010589) (← links)
- Ready-made short basis for GLV+GLS on high degree twisted curves (Q2129735) (← links)
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves (Q2140834) (← links)
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption (Q2152147) (← links)
- Families of SNARK-friendly 2-chains of elliptic curves (Q2170053) (← links)
- A taxonomy of pairing-friendly elliptic curves (Q2267367) (← links)
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited (Q2275939) (← links)
- Beta Weil pairing revisited (Q2313463) (← links)
- Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves (Q2348162) (← links)
- Short signatures without random oracles and the SDH assumption in bilinear groups (Q2425530) (← links)
- A Digital Signature Scheme Based on Two Hard Problems (Q2790443) (← links)
- Faster Hashing to ${\mathbb G}_2$ (Q2889888) (← links)
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves (Q2889998) (← links)
- Subgroup Security in Pairing-Based Cryptography (Q2946453) (← links)
- Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography (Q2947089) (← links)
- RNS arithmetic in 𝔽 pk and application to fast pairing computation (Q3015225) (← links)
- An Analysis of Affine Coordinates for Pairing Computation (Q3059636) (← links)
- Cryptographic Pairings Based on Elliptic Nets (Q3097999) (← links)
- Parallelizing the Weil and Tate Pairings (Q3104701) (← links)
- On the Efficient Implementation of Pairing-Based Protocols (Q3104702) (← links)
- Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2 (Q3104703) (← links)
- Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings (Q3104750) (← links)
