| Summary: | 碩士 === 稻江科技暨管理學院 === 網路系統學系碩士班 === 100 === It is a trend with digital signature form in the future and the elliptic curve cryptosystem have the advantages to encipher and decipher with fewer bits. Hence, many scholars proposed their digital signature scheme by using the advantages. In the schemes, Chung et al. proposed an ID-based digital signature scheme on elliptic curve cryptosystem. Their scheme really reduces the complexity of RSA digital signature. After, Yang et al. proposed an article of weakness of Chung et al.’s scheme. Yang et al. use the linear Diophantine equation successfully to avoid touching the elliptic curve discrete logarithm problem (ECDLP) in Chung et al.’s scheme. The signer’s secret code is obtained by an attacker. As the result, the Chung’s scheme becomes insecure.
Our digital signature scheme is protected for designing based on the elliptic curve discrete logarithm problem (ECDLP). We described the method and process of signature and verification in our scheme. Also, we make the analysis of the security and complexity in our scheme. We prove our scheme that is safe and the performance complexity is lower to compare Nyang et al.’s scheme and Chung et al.’s scheme. So, we propose a practical feasible elliptic curve digital signature system in condition of high security and low complexity.
|
|---|
