计算机应用 ›› 2009, Vol. 29 ›› Issue (09): 2342-2343.

• 信息安全 • 上一篇    下一篇

基于离散对数的数字签名方案

朱紫钊1,姚国祥2   

  1. 1. 广东省广州市暨南大学
    2.
  • 收稿日期:2009-03-23 修回日期:2009-05-16 发布日期:2009-11-10 出版日期:2009-09-01
  • 通讯作者: 朱紫钊
  • 基金资助:
    国家级基金;省部级基金

New digital signature scheme based on discrete logarithm

  • Received:2009-03-23 Revised:2009-05-16 Online:2009-11-10 Published:2009-09-01

摘要: 分析了离散对数问题(DLP),以素数域上的离散对数为基础,同时结合有限域上的椭圆曲线离散对数问题,提出一种新的数字签名方案,其安全性建立在离散对数算法上。同时,分析了该签名方案的安全性,并将其与其他签名方案的性能进行比较。比较结果显示基于离散对数的数字签名方案比其他的数字签名方案效率要高,而且更安全。

关键词: 公钥密码, 数字签名, 离散对数, 椭圆曲线

Abstract: The Discrete Logarithm Problem (DLP) was analyzed. Based on the discrete logarithm in the prime field, and combined with the elliptic curve DLP in the limited domain, a new digital signature was brought up. In addition, the security of this digital signature was analyzed and its performance was compared with other signatures. The results of comparison prove that this new digital signature based on discrete logarithm is more effective and secure than the others.

Key words: public key, digital signature, discrete logarithm, elliptic curve

中图分类号: