DocumentCode
1148703
Title
A Computer Algorithm for Calculating the Product AB Modulo M
Author
Blakely, G.R.
Author_Institution
Department of Mathematics, Texas A&M University
Issue
5
fYear
1983
fDate
5/1/1983 12:00:00 AM
Firstpage
497
Lastpage
500
Abstract
It is possible to find the smallest nonnegative integer R congruent modulo M to the product AB of two nonnegative integers without dividing by M. In multiple precision arithmetic, doing away with the division cuts the calculation time by varying amounts, depending on machine architecture. It also cuts storage space.
Keywords
Algorithms; integer arithmetic; modular arithmetic; modular multiplication; multiple precision arithmetic; products; products in Galois fields; seminumerical algorithms; Algorithms; Computer architecture; Computer errors; Digital arithmetic; Digital signatures; Error correction codes; Galois fields; Mathematics; Notice of Violation; Welding; Algorithms; integer arithmetic; modular arithmetic; modular multiplication; multiple precision arithmetic; products; products in Galois fields; seminumerical algorithms;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1983.1676262
Filename
1676262
Link To Document