DocumentCode
1151691
Title
Comments on "A Computer Algorithm for Calculating the Product AB Modulo M"
Author
Sloan
Author_Institution
Department of Computer Science, University of Washington
Issue
3
fYear
1985
fDate
3/1/1985 12:00:00 AM
Firstpage
290
Lastpage
292
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.
Keywords
Algorithms; integer arithmetic; long division; modular arithmetic; modular multiplication; multiple precision arithmetic; Arithmetic; Computer architecture; Computer science; Constraint optimization; Fasteners; Interleaved codes; Algorithms; integer arithmetic; long division; modular arithmetic; modular multiplication; multiple precision arithmetic;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1985.1676574
Filename
1676574
Link To Document