| 基于离散对数和因子分解的签名方案 |
| |
| 引用本文： | 杨刚,李艳俊. 基于离散对数和因子分解的签名方案[J]. 北京理工大学学报, 2004, 24(4): 324-326 |
| |
| 作者姓名： | 杨刚 李艳俊 |
| |
| 作者单位： | 北京理工大学,理学院,北京,100081;北京理工大学,理学院,北京,100081 |
| |
| 摘 要： | 以吴秋新提出的签名方案为例子,通过设法攻击指出了它的安全性只是基于因子分解难题,并在此基础上,设计出一种新的签名方案.该方案签名步骤简捷,安全性严格基于因子分解和离散对数两大难题.对方案进行了多角度的详细分析,并与吴秋新的方案进行了比较,充分证实了该方案的优越性.
|
| 关 键 词： | 离散对数 因子分解 哈希函数 |
| 文章编号： | 1001-0645(2004)04-0324-03 |
| 收稿时间： | 2003-04-07 |
| 修稿时间： | 2003-04-07 |
A New Digital Signature Scheme Based on Discrete Logarithms and Factoring |
| |
| YANG Gang and LI Yan-jun. A New Digital Signature Scheme Based on Discrete Logarithms and Factoring[J]. Journal of Beijing Institute of Technology(Natural Science Edition), 2004, 24(4): 324-326 |
| |
| Authors: | YANG Gang and LI Yan-jun |
| |
| Affiliation: | School of Science, Beijing Institute of Technology, Beijing100081, China;School of Science, Beijing Institute of Technology, Beijing100081, China |
| |
| Abstract: | Analyzes the security of the signature scheme as put forward by Xinqiu Wu and proves that its security is only based on the difficulty of factoring on attacking the scheme. In succession a new digital signature scheme is given. Its operating speed is faster, and its security is strictly based on the difficulties of discrete logarithms and factoring. Properties of this new scheme and a comparison between the two schemes are also discussed in some detail. |
| |
| Keywords: | discrete logarithms factoring Hash function |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《北京理工大学学报》浏览原始摘要信息 |
|
点击此处可从《北京理工大学学报》下载全文 |
|
