Abstract:
The modular multiplication algorithm (MMA) was presented as a method of calculating " the smallest nonnegative integer R congruent modulo M to the product AB of two noneg...Show MoreMetadata
Abstract:
The modular multiplication algorithm (MMA) was presented as a method of calculating " the smallest nonnegative integer R congruent modulo M to the product AB of two nonegative integers without dividing by M."1 The claim that division is avoided is technically correct, but misleading. A minor modification calculates both R and Q such that AB = MQ + R. A simplified version of the new algorithm is given and an alternate derivation is shown to illustrate the key ideas behind the method.
Published in: IEEE Transactions on Computers ( Volume: C-34, Issue: 3, March 1985)