Signature scheme based on composite discrete logarithm
Chik How Tan, Xun Yi, Chee Kheong Siew · 2004
In this paper, we proposed a digital signature scheme based on composite discrete logarithm. We show that the proposed scheme is secure against existential forgery under adaptive chosen-message attack relative to the hardness of discrete logarithm. Furthermore, we show that the proposed scheme is not only computationally efficient but is also more efficient than the other schemes. In signature generation, the proposed signature scheme is 13.5 times faster than RSA [R.L. Rivest et al., 1978], 3 times faster than DSA [A, Odlyzko, 1995], at least 1.5 times faster than Pointcheval scheme [G. Poupard et al., 1998] and Poupard-Stern scheme [T. Okamoto et al., 1998] respectively. In signature verification, the proposed signature scheme is 6 times faster than Poupard-Stern scheme and has the same verification time as that of RSA and Pointcheval scheme.