Pages that link to "Item:Q5712513"
From MaRDI portal
The following pages link to Computational Science and Its Applications – ICCSA 2004 (Q5712513):
Displaying 9 items.
- On the complexity of parallel algorithms for computing inverses in \(\text{GF}(2^m)\) with \(m\) prime (Q850789) (← links)
- A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases (Q1120276) (← links)
- Itoh-Tsujii inversion in standard basis and its application in cryptography and codes (Q1598873) (← links)
- Inversor of digits \(Q^\ast_2\)-representative of numbers (Q2028185) (← links)
- Parallel Itoh-Tsujii multiplicative inversion algorithm for a special class of trinomials (Q2384054) (← links)
- The Calcualtion of Multiplicative Inverses Over GF(P) Efficiently Where P is a Mersenne Prime (Q3714154) (← links)
- Effective recursive algorithm for computing multiplicative inverses in GF(2m) (Q4206832) (← links)
- Generalised fast algorithm for computing multiplicative inverses in<i>GF</i>(2<sup>m</sup>) (Q4206833) (← links)
- On computing multiplicative inverses in GF(2/sup m/) (Q5375329) (← links)