Pages that link to "Item:Q3562898"
From MaRDI portal
The following pages link to Faster Pairing Computations on Curves with High-Degree Twists (Q3562898):
Displayed 18 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)
- The pairing computation on Edwards curves (Q460158) (← links)
- A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties (Q741253) (← links)
- Parallelizing pairings on Hessian elliptic curves (Q1713870) (← links)
- Choosing and generating parameters for pairing implementation on BN curves (Q1745896) (← links)
- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level (Q2055706) (← links)
- Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree (Q2163356) (← links)
- Families of SNARK-friendly 2-chains of elliptic curves (Q2170053) (← links)
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation (Q2182074) (← links)
- Faster computation of the Tate pairing (Q2430985) (← links)
- RNS arithmetic in 𝔽 pk and application to fast pairing computation (Q3015225) (← links)
- An Analysis of Affine Coordinates for Pairing Computation (Q3059636) (← links)
- Parallelizing the Weil and Tate Pairings (Q3104701) (← links)
- Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings (Q3104750) (← links)
- Pairing Computation on Edwards Curves with High-Degree Twists (Q3454153) (← links)
- Efficient Self-pairing on Ordinary Elliptic Curves (Q4922135) (← links)
- A formula for disaster: a unified approach to elliptic curve special-point-based attacks (Q6157489) (← links)