Problem with montgomery algorithm

From: Giox (5218invalid_at_mynewsgate.net)
Date: 05/28/04 

Date: Fri, 28 May 2004 06:19:35 GMT

Hello everybody, I am an italian student and I have a problem with the
MonPro algorithm. I read the paper "Analyzing and Comparing Montgomery
Multiplication Algorithms" because it's considered the better paper
about this argument freely available on the web (also in this NG it's
often referenced). In this paper I found that it's possible to use the
least significant word of n' (indicated as n'0), instead of n'. I don't
understand why it's possibile to do that. I tried to read the paper "A
cryptographic library for the Motorola DSP56000" (in which this trick
has been proposed), but I didn't understand the short explication given
about this argument.
I will appreciate your help. I think that the explanation is not very
difficult (because I didn't find a paper with an explicit explanation
of this topic), but I wasn't able to find it.
If possible can you give also a little example? Thanks a lot 

--
La mia mail è 
giovanni.parodi79RIMUOVISPAM@lycos.it
Inviato da www.mynewsgate.net