Has anybody read the paper "The Montgomery Inverse and it's Applications" by Kaliski (published 1995) ?
Can you please explain theorem 3 in that paper?
Academic paper related to mathematics of cryptography
i read this much
and didnt read any moreAbstract
The Montgomery inverse of b module a is b-12n mod a, where n is the number of bits in a. The right-shifting binary algorithm for modular inversion is shown naturally to compute the new inverse in fewer operations than the ordinary modular inverse. The new inverse facilitates recent work by Koc on modular exponentiation and has other applications in cryptography
Price: $30
there is a bit more here but coudnt be bothered.
http://citeseerx.ist.psu.edu/viewdoc/do ... 1&type=pdf &
http://www.uclouvain.be/crypto/services ... 706466.pdf
http://citeseerx.ist.psu.edu/viewdoc/do ... 1&type=pdf &
http://www.uclouvain.be/crypto/services ... 706466.pdf