| 一个基于强RSA数字签名方案的改进 |
| |
| 引用本文： | 曹正军,刘木兰.一个基于强RSA数字签名方案的改进[J].计算机学报,2006,29(9):1617-1621. |
| |
| 作者姓名： | 曹正军 刘木兰 |
| |
| 作者单位： | 1. 上海大学数学系,上海,200444;中国科学院数学与系统科学研究院数学机械化重点实验室,北京,100080
2. 中国科学院数学与系统科学研究院数学机械化重点实验室,北京,100080 |
| |
| 基金项目： | 国家自然科学基金;国家重点基础研究发展计划(973计划) |
| |
| 摘 要： | 该文改进了Zhu等人的基于强RSA的数字签名方案．原方案在系统建立阶段必须选取QRn中的三个生成元，并且签名人在签名阶段还必须选取一个固定长度的素数．改进方案只需选取两个生成元，而且只需选取一个固定长度的奇数．新方案的计算量约是原方案的1／2．在强RSA假设下，文中分析了改进方案的安全性．
|
| 关 键 词： | 强RSA假设 生成元 自适应选择消息攻击 存在型伪造 |
| 收稿时间： | 2006-03-20 |
| 修稿时间： | 2006-03-202006-05-30 |
Improvement of a Signature Scheme Based on Strong RSA |
| |
| CAO Zheng-Jun,LIU Mu-Lan.Improvement of a Signature Scheme Based on Strong RSA[J].Chinese Journal of Computers,2006,29(9):1617-1621. |
| |
| Authors: | CAO Zheng-Jun LIU Mu-Lan |
| |
| Affiliation: | 1. Department of Mathematics, Shanghai University, Shanghai 200444; 2. Key Laboratory of Mathematics Mechanization, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080 |
| |
| Abstract: | This paper improves the signature scheme based on strong RSA proposed by Zhu in 2001. The original scheme should select three generators in QR, in the setup phase. In signing phase, the signer has to choose a prime number with prescribed length. The authors remove these restrictions. Only two generators and an odd should be selected in the improved scheme. The scheme saves about 1/2 computation cost of the original scheme. The authors also analyze its security under strong RSA. |
| |
| Keywords: | strong RSA generator adaptive chosen-message attack existential forgery |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
