Abstract

Qin Yanlin and Wu Xiaoping proposed a digital signature scheme based on elliptic curve discrete logarithm problem and factoring a composite integer. They claimed that the security of their scheme depends on solving ECDLP and factoring both. In this paper, it is shown that if anyone can solve ECDLP then he can generate a valid signature without knowledge of private keys. An improved scheme is also proposed in this paper. The proposed scheme requires minimal operations in encryption and decryption algorithms which makes it more efficient. General Terms 2000 AMS Subject Classification No. 94A60

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 call

Disclaimer: 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.