Digital signature schemes based on factoring and discrete logarithms

被引:12
|
作者
Shao, ZH [1 ]
机构
[1] Inst Sci & Technol, Dept Comp & Elect Engn, Hangzhou 310012, Zhejiang, Peoples R China
关键词
Digital signature generation - Digital signature verification - Discrete logarithm problem;
D O I
10.1049/el:20021093
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Wei-Hua He recently proposed a digital signature scheme based on two well-known mathematics hard problem assumptions. The security of the proposed scheme is based on the difficulties of simultaneously solving the factoring and discrete logarithm problems with almost the same sizes of arithmetic moduli. It is shown that He's scheme is not secure if attackers can solve discrete logarithm problems.
引用
收藏
页码:1518 / 1519
页数:2
相关论文
共 50 条