In several cryptographic protocols the product of a small number of ex
ponentiations is required, but the separate exponentiation results are
not needed. A simultaneous exponentiation algorithm that takes advant
age of this situation and that is substantially faster than the ordina
ry approach using separate exponentiations is presented.