The following pages link to Pairing Lattices (Q3600491):
Displaying 27 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)
- Optimal pairing computation over families of pairing-friendly elliptic curves (Q429764) (← links)
- The pairing computation on Edwards curves (Q460158) (← 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)
- Parallelizing pairings on Hessian elliptic curves (Q1713870) (← links)
- Choosing and generating parameters for pairing implementation on BN curves (Q1745896) (← links)
- Faster pairing computation on genus \(2\) hyperelliptic curves (Q1944931) (← links)
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves (Q2140834) (← links)
- A taxonomy of pairing-friendly elliptic curves (Q2267367) (← links)
- Still wrong use of pairings in cryptography (Q2335138) (← links)
- Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves (Q2348162) (← links)
- Pairing inversion for finding discrete logarithms (Q2515203) (← links)
- Faster Hashing to ${\mathbb G}_2$ (Q2889888) (← links)
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves (Q2889998) (← links)
- Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography (Q2947089) (← links)
- Parallelizing the Weil and Tate Pairings (Q3104701) (← links)
- Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2 (Q3104703) (← links)
- Pairing Computation on Edwards Curves with High-Degree Twists (Q3454153) (← 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)
- Efficient Compression of SIDH Public Keys (Q5738894) (← links)
