On Calculating Multiplicative Inverses Modulo 2ᵐ

DOI10.1109/TC.2008.54MaRDI QIDQ4564095zbMATH OpenFDO

Authors Ortal Arazi, Hairong Qi

Publication date 12 June 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.2008.54

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Cited in

(7)

• Application of Euclid's algorithm to the computation of the inverse in modulo arithmetics
• A general method to decompose modular multiplicative inverse operators over group of units
• The Calcualtion of Multiplicative Inverses Over GF(P) Efficiently Where P is a Mersenne Prime
• On Newton–Raphson Iteration for Multiplicative Inverses Modulo Prime Powers
• On computing multiplicative inverses in GF(2/sup m/)
• On the difference between an integer and its inverse modulo \(n\). II
• Computational Science and Its Applications – ICCSA 2004

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)