Montgomery reduction/multiplication

I have a couple questions.

Montgomery multiplication is commutative correct? I must have something
wrong in my VHDL. Its interesting that my test vector matches one way, but
not the other.

Does anyone have a pointer to a paper or have a hardware oriented algorithm
to
compute (2^(2k) mod M)? I can do the brute force method, but I'm sure there
is a more elegant solution.

Is there anyway to get around the final comparison in the multiplication:
if (P>M) P=P-M? I thought I remembered seeing this in a paper or two, but
not quite sure I caught their point.

Thanks for any help.

-- Scott
Received on Thu Sep 29 21:44:44 2005