Advertisement

A Parallel Modular Exponentiation Scheme for Transformed Exponents

  • Chin-Chen Chang
  • Yeu-Pong Lai
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3756)

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.

Keywords

Mixed radix conversion modular exponentiation parallel computation residue number system 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Arno, S., Wheeler, F.S.: Signed digit representations of minimal Hamming weight. IEEE Transactions on Computers 42, 1007–1010 (1993)CrossRefGoogle Scholar
  2. 2.
    Bos, J., Coster, M.: Addition chain heuristics. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 400–407. Springer, Heidelberg (1990)Google Scholar
  3. 3.
    Chang, C.C., Lai, Y.: A flexible data-attachment scheme on e-cash. Computers and Security 22, 160–166 (2003)CrossRefGoogle Scholar
  4. 4.
    ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory 31, 469–472 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Gordon, D.M.: A survey on fast exponentiation methods. Journal of Algorithms 27, 129–146 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Joye, M., Yen, S.: Optimal left-to-right binary signed-digit recoding. IEEE Transactions on Computers 49, 740–748 (2000)CrossRefGoogle Scholar
  7. 7.
    Lai, Y., Chang, C.C.: An efficient multi-exponentiation scheme based on modified Booth’s method. International Journal of Electronics 90, 221–233 (2003)CrossRefGoogle Scholar
  8. 8.
    Lai, Y., Chang, C.C.: Parallel computational algorithm for generalized Chinese remainder theorem. Computers and Electrical Engineering 29, 801–811 (2003)zbMATHCrossRefGoogle Scholar
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.
    Montgomery, P.: Modular multiplication without trail division. Mathematics of Computation 44, 519–521 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    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)zbMATHMathSciNetGoogle Scholar
  13. 13.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Chin-Chen Chang
    • 1
  • Yeu-Pong Lai
    • 2
  1. 1.Department of Information Engineering and Computer ScienceFeng Chia UniversityTaichungTaiwan, R.O.C.
  2. 2.Department of Information Engineering and Computer Science, Chung Cheng Institute of TechnologyNational Defense UniversityTauyuanTaiwan

Personalised recommendations