Methods and applications of error-free computation
Methods and applications of error-free computation
Number theory in science and communication
Number theory in science and communication
Euclidean type algorithm for multiplication modulo P II
Journal of Information Processing
Design and implementation of Kyoto Common Lisp
Journal of Information Processing
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Algebraic simplification: a guide for the perplexed
Communications of the ACM
Complex Gaussian integers for “Gaussian graphics”
ACM SIGPLAN Notices
Division by invariant integers using multiplication
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
| Hi-index | 0.00 |
The modular product computation A*B (mod N) is a bottleneck for some public-key encryption algorithms, as well as many exact computations implemented using the Chinese Remainder Theorem. We show how to compute A*B (mod N) efficiently, for single-precision A, B, and N, on a modern RISC architecture (Intel 80860) in ANSI C. On this architecture, our method computes A*B (mod N) faster than ANSI C computes A%N, for unsigned longs A and N.