| 基于Lucas序列的盲签名方案 |
| |
| 引用本文： | 佟海,陈小松.基于Lucas序列的盲签名方案[J].电脑与信息技术,2006,14(2):34-37. |
| |
| 作者姓名： | 佟海 陈小松 |
| |
| 作者单位： | 中南大学数学科学与计算技术学院,湖南,长沙,410083 |
| |
| 基金项目： | 浙江省湖州市自然科学基金 |
| |
| 摘 要： | 对两种基于Lucas序列的盲签名方案,指出了可能存在的共同缺陷,对其中一种方案给出了攻击办法,并提出了一种基于Lucas序列的有抵抗被动和主动攻击的优点和高效率的盲签名方案,解决了前面两种基于Lucas序列的盲签名方案中存在的问题.
|
| 关 键 词： | Lucas序列 盲签名 大整数分解 |
| 文章编号： | 1005-1228(2006)02-0034-04 |
| 收稿时间： | 2006-01-08 |
| 修稿时间： | 2006年1月8日 |
Blind signature schemes based on Lucas sequences |
| |
| TONG Hai,CHEN Xiao-song.Blind signature schemes based on Lucas sequences[J].Computer and Information Technology,2006,14(2):34-37. |
| |
| Authors: | TONG Hai CHEN Xiao-song |
| |
| Affiliation: | College of Mathematical Sciences and Computational Technology, Central South University, Changsha , Hunan 410083 ,China |
| |
| Abstract: | For two kinds of blind signature schemes based on Lucas sequences, a possible fault is pointed out. For one of the two schemes, an attacking method is presented. Then a new blind signature scheme based on Lucas sequences is presented, which is efficient and has the advantage of resisting active attack and passive attack. Besides, it solves the problems of the former two schemes. |
| |
| Keywords: | Lucas sequences blind signature factoring problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
