Abstract
This paper introduces an efficient method to compute modular exponentiation operations in parallel. For the parallel process of a modular exponentiation operation, the exponent is transformed into mixed radix digits first. Each digit is then an exponent for a partial result of the modular exponentiation operation. Because the computing processes for these partial results are highly independent, they can be carried out concurrently. The bases in these partial exponentiation operations can be pre-computed and used till the exponent moduli set changed. If the largest mixed radix digit is k-bits with respect to m exponent moduli, the time complexity for the proposed scheme is then k+ log 2 m. The performing complexity is very efficient, compared with other methods. Since the comparison is based on the same modular multiplication hardware, the performance is better if the fewer operations required. In the scenario of two exponent moduli, the performance improvment is approximately 40%. Finally, the proposed scheme is presented with a parallel algorithm for which the computing architecture is also illustrated in the paper.
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
Arno, S., Wheeler, F.S.: Signed digit representations of minimal Hamming weight. IEEE Transactions on Computers 42, 1007–1010 (1993)
Bos, J., Coster, M.: Addition chain heuristics. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 400–407. Springer, Heidelberg (1990)
Chang, C.C., Lai, Y.: A flexible data-attachment scheme on e-cash. Computers and Security 22, 160–166 (2003)
ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory 31, 469–472 (1985)
Gordon, D.M.: A survey on fast exponentiation methods. Journal of Algorithms 27, 129–146 (1998)
Joye, M., Yen, S.: Optimal left-to-right binary signed-digit recoding. IEEE Transactions on Computers 49, 740–748 (2000)
Lai, Y., Chang, C.C.: An efficient multi-exponentiation scheme based on modified Booth’s method. International Journal of Electronics 90, 221–233 (2003)
Lai, Y., Chang, C.C.: Parallel computational algorithm for generalized Chinese remainder theorem. Computers and Electrical Engineering 29, 801–811 (2003)
Miller, D.F., McCormick, W.S.: An arithmetic free parallel mixed-radix conversion algorithm. IEEE Transactions on Circuits and systems–II: Analog and Digital Signal Processing 45, 158–162 (1998)
Montgomery, P.: Modular multiplication without trail division. Mathematics of Computation 44, 519–521 (1985)
Okeya, K., Sakurai, K.: Use of montgomery trick in precomputation of multi-scalar multiplication in elliptic curve cryptosystems. IEICE Transactions on Fundamentals E86-A, 98–112 (2003)
Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the Association for Computing Machinery 21, 120–126 (1978)
Rooij, P.: Efficient exponentiation using precomputation and vector addition chains. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 389–399. Springer, Heidelberg (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chang, CC., Lai, YP. (2005). A Parallel Modular Exponentiation Scheme for Transformed Exponents. In: Cao, J., Nejdl, W., Xu, M. (eds) Advanced Parallel Processing Technologies. APPT 2005. Lecture Notes in Computer Science, vol 3756. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11573937_48
Download citation
DOI: https://doi.org/10.1007/11573937_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29639-3
Online ISBN: 978-3-540-32107-1
eBook Packages: Computer ScienceComputer Science (R0)