Cryptanalysis on 3F-L Digital Signature and Its Modification ( 1.School of Mathematics and Computer Science,Hubei University,Wuhan,Hubei 430062,China; 2.State Key Lab of Information Security ,Beijing 100049,China)

HU Qing-feng; HU Lei; LIU He-guo

您当前的位置：

首页 >

文章列表页 >

Cryptanalysis on 3F-L Digital Signature and Its Modification ( 1.School of Mathematics and Computer Science,Hubei University,Wuhan,Hubei 430062,China; 2.State Key Lab of Information Security ,Beijing 100049,China)

更新时间：2025-07-16

- Cryptanalysis on 3F-L Digital Signature and Its Modification ( 1.School of Mathematics and Computer Science,Hubei University,Wuhan,Hubei 430062,China; 2.State Key Lab of Information Security ,Beijing 100049,China)
- Acta Electronica Sinica Vol. 33, Issue 3, Pages: 492-495(2005)
- 作者机构：
  
  1. 湖北大学数学与计算机科学学院,湖北,武汉,430062
  2. 信息安全国家重点实验室(中国科学院研究生院),北京 1000349
  3. 湖北大学数学与计算机科学学院湖北武汉,430062
  4. 信息安全国家重点实验室(中国科学院研究生院)北京 1000349
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP309.18
- Published：2005
- 稿件说明：
移动端阅览
HU Qing-feng, HU Lei, LIU He-guo. Cryptanalysis on 3F-L Digital Signature and Its Modification ( 1.School of Mathematics and Computer Science,Hubei University,Wuhan,Hubei 430062,China; 2.State Key Lab of Information Security ,Beijing 100049,China)[J]. Acta Electronica Sinica, 2005, 33(3): 492-495.
DOI：

HU Qing-feng, HU Lei, LIU He-guo. Cryptanalysis on 3F-L Digital Signature and Its Modification ( 1.School of Mathematics and Computer Science,Hubei University,Wuhan,Hubei 430062,China; 2.State Key Lab of Information Security ,Beijing 100049,China)[J]. Acta Electronica Sinica, 2005, 33(3): 492-495. DOI：

摘要

本文对3F-L数字签名方案进行分析

给出了对该方案的一般性签名伪造攻击;针对该方案签名数据太长的缺点

基于GF(p

)上离散对数的计算困难性

提出了一个Nyberg-Rueppel型的修改方案

其签名规模由5log(p)比特约减为2log(p)比特;并对改进方案的计算效率进行了分析。

Abstract

A universal forgery attack on the 3F-L digital signature scheme is given.To avoid the flaw of long signature result

a modified version of the 3F-L signature scheme of Nyberg-Ruppel type is proposed.The security and computation efficiency of the modified scheme are analyzed

and the result shows that the security is based on the computational infeasibility of discrete logarithms on GF(p

关键词

Keywords

references

Views

862

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰