Methods of Fast Exponentiation
Mohammed Al-Maitah
Journal of Computer Science, Volume 6, Issue 5, pp. 519–524 · 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.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2010 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
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
- Licence
- © Science Publications
- Issue
- Volume 6, Issue 5
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
