On Calculating Multiplicative Inverses Modulo $2^{m}$
From MaRDI portal
Publication:4564095
DOI10.1109/TC.2008.54zbMATH Open1390.11008MaRDI QIDQ4564095
Publication date: 12 June 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Related Items (7)
The Calcualtion of Multiplicative Inverses Over GF(P) Efficiently Where P is a Mersenne Prime ⋮ Application of Euclid's algorithm to the computation of the inverse in modulo arithmetics ⋮ Computational Science and Its Applications – ICCSA 2004 ⋮ On computing multiplicative inverses in GF(2/sup m/) ⋮ A general method for to decompose modular multiplicative inverse operators over Group of units ⋮ On the difference between an integer and its inverse modulo \(n\). II ⋮ On Newton–Raphson Iteration for Multiplicative Inverses Modulo Prime Powers
This page was built for publication: On Calculating Multiplicative Inverses Modulo $2^{m}$
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4564095)
