Abstract
The normal form and modified normal form for binary redundant representation are defined. A redundant binary algorithm to compute modular exponentiation for very large integers is proposed. It is shown that the proposed algorithm requires the minimum number of basic operations (modular multiplications) among all possible binary redundant representations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Rviest R L, Shamir A, Adleman L. A method for obtaining digital signatures and public-key cryptosystem.Communication of the ACM, 1978, 21(2): 120–126.
Knuth D E. Seminumerical Algorithm—The Art of Computer Programming. Vol.2, Chapter 4, Addison-Wesley, Reading, MA, 1981.
Selby A, Mitchell C. Algorithms for software implementations of RSA.IEE, Part E., 1989, 136(3): 166–170.
Yun D Y Y, Zhang C N. A fast carry-free algorithm and hardware design for extended integer GCD computation. InInternational ACM Conference on Symbolic and Algebra Computation, Waterloo, Canada, July 1986, pp.82–84.
Author information
Authors and Affiliations
Additional information
Shi Ronghua received his B.S. degree in computer software from Changsha Railway University in 1986, and his M.S. degree in computer science from Central South University of Technology in 1989. He has been working in the Changsha Railway University since 1989, and is currently a Lecturer of the Department of Electronic Engineering. His current research interests include computer networks, algorithm and system, broadband ISDN.
Rights and permissions
About this article
Cite this article
Shi, R. A redundant binary algorithm for RSA. J. of Comput. Sci. & Technol. 11, 416–420 (1996). https://doi.org/10.1007/BF02948485
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02948485