HYBRID METHOD FOR MODULAR EXPONENTIATION WITH PRECOMPUTATION

The authors present a new hybrid method for perfonming modular exponen tiation using a hybrid ternary-quinary number system. A recent result concerning performing modular exponentiation with precomputation was p resented by Dimitrov and Cooklev: their average number of modular mult iplications is 0.3381n, where n is the length of the modulus, while th e authors' proposed method only needs 0.3246n modular multiplications. Furthermore, compared to Dimitrov and Cooklev's approach, the authors ' method reduces the amount of storage by 56.8% if the modulus is a 51 2 bit number.