Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
W. Diffie, M. Hellman. New direction in cryptograph, IEEE Trans. Inf, Theory, IT-22:6(1976), 644–654.
R.L. Rivest, A. Shamir, L. Adleman, A Method for Obtaining Digital Sign- atures and Public-Key Cryptosystems. Comm. ACM Vol.21(2),120–126, Feb. 1978.
R. Tanaka and N. Szabo. Residue Arithmetic and Its Application to Comp- uter Technology, McGraw-Hill, New York 1968.
Author information
Authors and Affiliations
Additional information
This research is supported by the National Natural Science Foundation.
Rights and permissions
About this article
Cite this article
Dawei, D., Jingwei, H. A practical parallel algorithm for computinga b modc * . Wuhan Univ. J. of Nat. Sci. 1, 446–449 (1996). https://doi.org/10.1007/BF02900867
Issue Date:
DOI: https://doi.org/10.1007/BF02900867