Pages that link to "Item:Q2317387"
From MaRDI portal
The following pages link to Improving the computation of the optimal ate pairing for a high security level (Q2317387):
Displaying 6 items.
- Memory-saving computation of the pairing final exponentiation on BN curves (Q285907) (← links)
- Efficient optimal ate pairing at 128-bit security level (Q1746839) (← links)
- Computing the optimal ate pairing over elliptic curves with embedding degrees 54 and 48 at the 256-bit security level (Q2019841) (← links)
- High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves (Q3059638) (← links)
- A survey of elliptic curves for proof systems (Q6063127) (← links)
- Pairings in rank-1 constraint systems (Q6535081) (← links)