New Digital Signature Scheme Based on both ECDLP and IFP

摘要：

Based on the analysis of Elliptic Curve Digital Signature Algorithm(ECDSA) and a group of digital signature schemes including two hard problems, a new digital signature scheme based on both Elliptic Curve Discrete Logarithm Problem and Integer Factoring Problem is proposed.The scheme’s security is analyzed to show that only when parameter k is one-off in each signing process it is indeed a scheme based on two hard problems.

关键词： digital signature Elliptic Curve Discrete Logarithm Integer Factoring Problem

作者: Qin Yanlin Wu Xiaoping

作者单位: Department of Information Security Naval University of Engineering Wuhan, China

会议类型: 国际会议

会议名称: 2009 2nd IEEE International Conference on Computer Science and Information Technology(第二届计算机科学与信息技术国际会议 ICCSIT2009)

会议地点: 北京

会议语种:英文

页码: 1669-1672

在线出版日期: 2009-08-08（万方平台首次上网日期，不代表论文的发表时间）