Pages that link to "Item:Q3522142"
From MaRDI portal
The following pages link to Efficient Hardware for the Tate Pairing Calculation in Characteristic Three (Q3522142):
Displaying 10 items.
- Complexity of computation in finite fields (Q378003) (← links)
- A new bit-serial multiplier over \(GF(pm)\) using irreducible trinomials (Q604106) (← links)
- Formulas for cube roots in \(\mathbb F_{3^m}\) (Q868380) (← links)
- On the distribution of irreducible trinomials over \(\mathbb F_3\) (Q2370648) (← links)
- On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings (Q2453385) (← links)
- Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18 (Q3506396) (← links)
- Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition (Q3600511) (← links)
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ (Q3600512) (← links)
- On Software Parallel Implementation of Cryptographic Pairings (Q3644191) (← links)
- Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$ (Q5452256) (← links)
