Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference13 articles.
1. ANSI C. Draft Proposed American National Standard Programming Language C. ANSI NY 1988. ANSI C. Draft Proposed American National Standard Programming Language C . ANSI NY 1988.
2. A Computer Algorithm for Calculating the Product AB Modulo M
3. A generalisation of Brickell's algorithm for fast modular multiplication
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献