Pages that link to "Item:Q3714154"
From MaRDI portal
The following pages link to The Calcualtion of Multiplicative Inverses Over GF(P) Efficiently Where P is a Mersenne Prime (Q3714154):
Displaying 5 items.
- A general method for to decompose modular multiplicative inverse operators over Group of units (Q3295207) (← links)
- Generalised fast algorithm for computing multiplicative inverses in<i>GF</i>(2<sup>m</sup>) (Q4206833) (← links)
- On Newton–Raphson Iteration for Multiplicative Inverses Modulo Prime Powers (Q5268120) (← links)
- On computing multiplicative inverses in GF(2/sup m/) (Q5375329) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5712513) (← links)