The Community for Technology Leaders
RSS Icon
Issue No.05 - May (1983 vol.32)
pp: 497-500
G.R. Blakely , Department of Mathematics, Texas A&M University
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.
seminumerical algorithms, Algorithms, integer arithmetic, modular arithmetic, modular multiplication, multiple precision arithmetic, products, products in Galois fields
G.R. Blakely, "A Computer Algorithm for Calculating the Product AB Modulo M", IEEE Transactions on Computers, vol.32, no. 5, pp. 497-500, May 1983, doi:10.1109/TC.1983.1676262
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool