Pages that link to "Item:Q4827601"
From MaRDI portal
The following pages link to Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems (Q4827601):
Displayed 8 items.
- A comparison of MNT curves and supersingular curves (Q862563) (← links)
- Formulas for cube roots in \(\mathbb F_{3^m}\) (Q868380) (← links)
- A taxonomy of pairing-friendly elliptic curves (Q2267367) (← links)
- On the arithmetic operations over finite fields of characteristic three with low complexity (Q2349632) (← links)
- On the distribution of irreducible trinomials over \(\mathbb F_3\) (Q2370648) (← links)
- A simple point counting algorithm for Hessian elliptic curves in characteristic three (Q2432551) (← links)
- A Provably Secure One-Pass Two-Party Key Establishment Protocol (Q3600324) (← links)
- Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition (Q3600511) (← links)