Pages that link to "Item:Q4589560"
From MaRDI portal
The following pages link to Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials (Q4589560):
Displayed 3 items.
- Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves (Q2018146) (← links)
- Parallel Itoh-Tsujii multiplicative inversion algorithm for a special class of trinomials (Q2384054) (← links)
- A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$ (Q3600512) (← links)
