Pages that link to "Item:Q3003374"
From MaRDI portal
The following pages link to Faster Explicit Formulas for Computing Pairings over Ordinary Curves (Q3003374):
Displaying 12 items.
- Effective compression maps for torus-based cryptography (Q264119) (← links)
- Memory-saving computation of the pairing final exponentiation on BN curves (Q285907) (← links)
- An efficient ring signature scheme from pairings (Q528720) (← links)
- Low-cost addition-subtraction sequences for the final exponentiation in pairings (Q740296) (← links)
- Implementing optimized pairings with elliptic nets (Q893619) (← links)
- Parallelizing pairings on Hessian elliptic curves (Q1713870) (← links)
- Choosing and generating parameters for pairing implementation on BN curves (Q1745896) (← 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)
- Secure and Efficient Pairing at 256-Bit Security Level (Q6487201) (← links)
- SCRAPE: Scalable Randomness Attested by Public Entities (Q6487218) (← links)
- Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition (Q6488029) (← links)
