The following pages link to Pairing Lattices (Q3600491):
Displayed 15 items.
- Self-pairings on supersingular elliptic curves with embedding degree \textit{three} (Q402545) (← links)
- Optimal pairing computation over families of pairing-friendly elliptic curves (Q429764) (← links)
- The pairing computation on Edwards curves (Q460158) (← 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)
- Faster pairing computation on genus \(2\) hyperelliptic curves (Q1944931) (← links)
- A taxonomy of pairing-friendly elliptic curves (Q2267367) (← links)
- Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves (Q2348162) (← links)
- Faster Hashing to ${\mathbb G}_2$ (Q2889888) (← links)
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves (Q2889998) (← links)
- Parallelizing the Weil and Tate Pairings (Q3104701) (← links)
- Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2 (Q3104703) (← links)
- Efficient Self-pairing on Ordinary Elliptic Curves (Q4922135) (← links)
- Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs (Q5418497) (← links)