Abstract
Exponentiation of large positive integer with a 512-bit exponent is the basis of several well-known cryptographic algorithms. In this paper, an adaptive method for improving the performance of the m-ary method is proposed and analyzed. Due to the efficient utilization of partial results, it is useful for systems with varied exponent and base. This method is based on two ideas. Firstly, for base x, a few of the exponentiations with smaller exponents are precomputed on-line, that is, x 2, x 3,…, x (2 w −1) are precomputed, where w is an optimization parameter. Secondly, a number of used partial results will be determined and stored in a look-up table during the computation. Assume that squaring is free as compared with multiplication, depending on the numbers of precomputations and partial results, the proposed method on average gives a 26–40% time reduction as compared with the m-ary method. On the other hand, it does require little temporary storage for the used partial results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
