New signature scheme based on two cryptographic assumptions  

一种基于2个密码学假定的数字签名方案(英文)

作　　者：郑明辉[1] 崔国华[1] 

机构地区：[1]华中科技大学计算机科学与技术学院

出　　处：《Journal of Southeast University(English Edition)》2007年第3期461-464,共4页东南大学学报（英文版）

基　　金：The National Natural Science Foundation of China(No60402019);the Science Research Program of Education Bureau of Hubei Province (NoQ200629001)

摘　　要：In order to improve the security of the signature scheme, a digital signature based on two hard-solved problems is proposed. The discrete logarithm problem and the factoring problem are two well known hard- solved mathematical problems. Combining the E1Gamal scheme based on the discrete logarithm problem and the OSS scheme based on the factoring problem, a digital signature scheme based on these two cryptographic assumptions is proposed. The security of the proposed scheme is based on the difficulties of simultaneously solving the factoring problem and the discrete logarithm problem. So the signature scheme will be still secure under the situation that any one of the two hard-problems is solved. Compared with previous schemes, the proposed scheme is more efficient in terms of space storage, signature length and computation complexities.为了提高数字签名方案的安全强度,设计了一个同时基于2个难解问题的数字签名方案.离散对数问题和因式分解问题是密码学中2个著名的难解问题,融合基于离散对数难题的ElGamal数字签名方案和基于因式分解难题的OSS数字签名方案,提出了一种安全性同时基于离散对数问题和因式分解问题的数字签名方案.安全分析得出在一个难题被解的情况下该方案仍然是安全的.与已有的类似方案比较,所提出的签名方案具有更短的签名长度,更低的存储开销和计算开销.

关 键 词：digital signature SECURITY factoring problem discrete logarithm problem 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]