Methods of Fast Exponentiation
DOI : 10.3844/jcssp.2010.519.524
Journal of Computer Science
Volume 6, Issue 5
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.
© 2010 Mohammed Al-Maitah. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.