Log In Sign Up

An Improved Integer Modular Multiplicative Inverse (modulo 2^w)

by   Jeffrey Hurchalla, et al.

This paper presents an algorithm for the integer multiplicative inverse (mod 2^w) which completes in the fewest cycles known for modern microprocessors, when using the native bit width w for the modulus 2^w. The algorithm is a modification of a method by Dumas, and for computers it slightly increases generality and efficiency. A proof is given, and the algorithm is shown to be closely related to the better known Newton's method algorithm for the inverse. Simple direct formulas, which are needed by this algorithm and by Newton's method, are reviewed and proven for the integer inverse modulo 2^k with k = 1, 2, 3, 4, or 5, providing the first proof of the preferred formula with k=4 or 5.


page 1

page 2

page 3

page 4


Improving the accuracy of the fast inverse square root algorithm

We present improved algorithms for fast calculation of the inverse squar...

Inverse Cubic Iteration

There are thousands of papers on rootfinding for nonlinear scalar equati...

A more direct and better variant of New Q-Newton's method Backtracking for m equations in m variables

In this paper we apply the ideas of New Q-Newton's method directly to a ...

Canonical form of modular hyperbolas with an application to integer factorization

For a composite n and an odd c with c not dividing n, the number of solu...

Learning Preconditioners on Lie Groups

We study two types of preconditioners and preconditioned stochastic grad...

Faster Remainder by Direct Computation: Applications to Compilers and Software Libraries

On common processors, integer multiplication is many times faster than i...