Mersenne: Head's algorithm for multiplying mod n

[Lucas Wiman]

All,
In the book _Primes and Programming_ Head's method of multiplying
two numbers mod n is mentioned.  Is this actually more effiecient
than simply multiplying the two numbers and taking the modulus?

If so, is it implemented in the various mersenne factoring programs
in use?

Thankyou,
Lucas Wiman

________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm