A Computer Algorithm for Calculating the Product AB Modulo M
- 1 May 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-32 (5) , 497-500
- https://doi.org/10.1109/tc.1983.1676262
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
This publication has 5 references indexed in Scilit:
- A carry-free algorithm for finding the greatest common divisor of two integersComputers & Mathematics with Applications, 1983
- Security Proofs for Information Protection SystemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- A high security log-in procedureCommunications of the ACM, 1974