Fast algorithms for multi exponentiation in public key cryptography
Multi exponentiation is one of the important operation for public key cryptography.This paper presents two effective algorithms for multi exponentiation when the inverse element is not easy to compute.First,transferring the exponents to joint sparse form and string replacement form for fixed base and unfixed base multi exponentiation separately,and then using the fast Shamir algorithm to obtain the result.The new algorithms reduce the operation number of fast Shamir algorithm effectively.