Pages that link to "Item:Q4564095"
From MaRDI portal
The following pages link to On Calculating Multiplicative Inverses Modulo $2^{m}$ (Q4564095):
Displaying 7 items.
- On the difference between an integer and its inverse modulo \(n\). II (Q551764) (← links)
- Application of Euclid's algorithm to the computation of the inverse in modulo arithmetics (Q1128755) (← links)
- A general method for to decompose modular multiplicative inverse operators over Group of units (Q3295207) (← links)
- The Calcualtion of Multiplicative Inverses Over GF(P) Efficiently Where P is a Mersenne Prime (Q3714154) (← 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)