基于离散对数和因子分解具有消息恢复的签名方案  

Signature scheme with message recovery based on discrete logarithms and factoring

作　　者：袁喜凤[1] 孙艳蕊[1] 孙金青[1] 杨迎辉[1] 

机构地区：[1]东北大学理学院,沈阳110004

出　　处：《计算机应用》2007年第10期2459-2460,2463,共3页journal of Computer Applications

基　　金：国家自然科学基金资助项目(60475036)

摘　　要：基于双难题具有消息恢复的签名方案研究甚少,仅有的一些方案都存在计算效率和传输效率过低的问题。由此提出了一个新的同时基于离散对数和大整数分解两种困难问题的具有消息恢复的签名方案,并对其进行安全性分析及效率分析。其安全性要比基于一个难题的数字签名方案好,并且该方案比已有的基于双难题的具有消息恢复签名方案效率要高。Recently, there is little research about digital schemes with message recovery based on double hard problems. The computational efficiency and transmission efficiency of the existing schemes is too low. Hence, in the paper, a new digital signature scheme with message recovery was given, in which the security was based on the difficulties of computing discrete logarithms and factoring. And its security analysis and efficiency analysis were also given. The security of the scheme is consequently better than those of the signature schemes which are based on the difficulty of a single problem. And the scheme proposed has higher efficiency than the schemes which exist now.

关 键 词：数字签名 消息恢复 离散对数 因子分解 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]