The following pages link to Faster Hashing to ${\mathbb G}_2$ (Q2889888):
Displaying 11 items.
- Memory-saving computation of the pairing final exponentiation on BN curves (Q285907) (← links)
- Low-cost addition-subtraction sequences for the final exponentiation in pairings (Q740296) (← links)
- Choosing and generating parameters for pairing implementation on BN curves (Q1745896) (← links)
- Updating key size estimations for pairings (Q2010589) (← links)
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves (Q2140834) (← links)
- Subgroup Security in Pairing-Based Cryptography (Q2946453) (← links)
- Efficient Implementation of Bilinear Pairings on ARM Processors (Q3455495) (← links)
- Adequate Elliptic Curves for Computing the Product of n Pairings (Q5267791) (← links)
- A survey of elliptic curves for proof systems (Q6063127) (← links)
- Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves (Q6074017) (← links)
- Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists (Q6136710) (← links)
