Abstract
Modular exponentiation is fundamental to several public-key cryptography systems such as the RSA encryption system, as well as the most dominant part of the computation performed. The operation is time consuming for large operands. This paper analyses and compares the complexity of a variety of algorithms proposed to compute the modular exponentiation of a relatively large binary number, and proposes a new parallel modular exponentiation method.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J. Bos and M. Coster, Addition chain heuristics, Proceedings of CRYPTO’89, Lecture Notes in Computer Science 435:400–407, Springer-Verlag, 1989.
P. Downey, B. Leony and R. Sethi, Computing sequences with addition chains, SIAM Journal on Computing, 3:638–696, 1981.
B.S. Kaliski Jr., The Z80180 and big-number arithmetic, Dr. Dobb’s Journal, 50:58, September 1993.
D.E. Knuth, The art of programming: seminumerical algorithms, volume 2. Reading, MA: Addison-Wesley, Second edition, 1981.
Ç.K. Koç, Analysis of sliding window techniques for exponentiation, Computers and Mathematics with Applications, 30(10):17–24, 1995.
Ç.K. Koç, High speed RSA implementation, Research Report, RSA Laboratories, Version 2, California, United States of America, 1994.
Ç.K. Koç and C.Y. Hung, Adaptive m-ary segmentation and canonical recoding algorithms for multiplication of large binary numbers, Computers and Mathematics with Applications, 24(3):3–12,1992.
Ç.K. Koç, High-radix and bit recoding techniques for modular exponentiation, International Journal of Computer Mathematics, 40(3&4):139–156, 1991.
N. Kunihiro and H. Yamamoto, Window and extended window methods for addition chain and addition-subtraction chain, IEICE Transactions, E81-A(1):72–81, January 1998.
N. Kunihiro and H. Yamamoto, New methods for generating short addition chain, IEICE Transactions, E83-A(1):60–67, January 2000.
A. Menezes, P. van Oorschot and S. Vanstone, Handbook of applied cryptography, CRC Press, 1996.
National Institute of Standards and Technology, Digital signature standard—DSS, Federal Register, 56:169, 1991.
R.L. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, 21(2):120–126, 1978.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nedjah, N., de Macedo Mourelle, L. (2002). Efficient Parallel Modular Exponentiation Algorithm. In: Yakhno, T. (eds) Advances in Information Systems. ADVIS 2002. Lecture Notes in Computer Science, vol 2457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36077-8_43
Download citation
DOI: https://doi.org/10.1007/3-540-36077-8_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00009-9
Online ISBN: 978-3-540-36077-3
eBook Packages: Springer Book Archive