A Strategy Speeds Up the Triple Modular Exponentiation

One of the important parts for computing ME mod N is the modular exponentiation, where M is a plaintext, N is a modulus, and E is a large exponent. The performance of the modular exponentiation algorithm depends on the numbers of modular square and modular multiplication for the exponent. The computational complexity for the strategy which is provided to speed up the triple modular exponentiation can be reduced to 1.875j multiplications, where j is the bit length of the exponent.