Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
