Improvement of Signature Scheme Based on Discrete Logarithms and Factoring
Fagen Li · Zhongguo tiedao kexue · 2006
Yang and Li proposed an efficient signature scheme that is strictly based on two hard problems of discrete logarithms and factoring.However,their scheme requires t+2 keys for a signing document,where t is the output bit length of a one-way Hash function and is usually equal to 128 or 160.To overcome the weakness of too many keys,we present an improvement of their signature scheme by getting rid of the one-way Hash function.We also consider 5 possible attacks and show that the improved scheme is secure if the discrete logarithms and factoring are simultaneously unsolvable.As compared with the Yang and Li's scheme in terms of the number of keys,computational complexity and communication cost, the improved scheme only needs 3 keys,lower computational complexity and same communication cost.