z-logo
open-access-imgOpen Access
Cryptanalysis and Improvement of Yanlin and Xiaoping's Signature Scheme based on ECDLP and Factoring
Author(s) -
Hemlal Sahu,
Birendra Kumar Sharma
Publication year - 2014
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/14825-3065
Subject(s) - factoring , computer science , signature (topology) , cryptanalysis , scheme (mathematics) , elgamal signature scheme , theoretical computer science , digital signature , algorithm , computer security , blind signature , cryptography , mathematics , hash function , mathematical analysis , geometry , finance , economics
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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom