A practical parallel algorithm for computinga b modc *
- 9 Downloads
In this paper, we propose a practical parallel algorithm for computinga b modc. The algorithm is based on RNS representatins of integers. In particular, a technique is introduced for avoiding overflow. The algorithm is easy to be implemented on hardware and achieves linear speedup.
Key wordsPublic key cryptosystem RSA cryptosystem RNS representation
Unable to display preview. Download preview PDF.
- R. Tanaka and N. Szabo. Residue Arithmetic and Its Application to Comp- uter Technology, McGraw-Hill, New York 1968.Google Scholar