Research Article Open Access

Methods of Fast Exponentiation

Mohammed Al-Maitah1
  • 1 , Afganistan
Journal of Computer Science
Volume 6 No. 5, 2010, 519-524

DOI: https://doi.org/10.3844/jcssp.2010.519.524

Submitted On: 29 March 2010 Published On: 31 May 2010

How to Cite: Al-Maitah, M. (2010). Methods of Fast Exponentiation. Journal of Computer Science, 6(5), 519-524. https://doi.org/10.3844/jcssp.2010.519.524

Abstract

Problem statement: Modular exponentiation constitutes the basis of many well-known and widely used public key cryptosystems. Approach: A fast portable modular exponentiation algorithm considerably enhanced the speed and applicability of these systems, also an efficient implementation of this algorithm was the key to high performance of such system. Results: In this study, two main approaches for solving this problem were proposed. The proposed approaches involved calculations without usage of extra operational memory for saving constants and calculations with usage of preliminary calculated constants. Conclusion/Recommendations: The estimation of complexity of the speedup and effectiveness of proposed approaches for the data were presented.

  • 1,114 Views
  • 1,629 Downloads
  • 0 Citations

Download

Keywords

  • Exponentiation
  • extra operational memory
  • consistent calculation
  • Fibonacci calculus