基于Lucas序列的盲签名方案  

Blind signature schemes based on Lucas sequences

作　　者：佟海[1] 陈小松[1] 

机构地区：[1]中南大学数学科学与计算技术学院,湖南长沙410083

出　　处：《电脑与信息技术》2006年第2期34-37,共4页Computer and Information Technology

基　　金：湖南省自然科学基金资助项目(02JJY3002)

摘　　要：对两种基于Lucas序列的盲签名方案,指出了可能存在的共同缺陷,对其中一种方案给出了攻击办法,并提出了一种基于Lucas序列的有抵抗被动和主动攻击的优点和高效率的盲签名方案,解决了前面两种基于Lucas序列的盲签名方案中存在的问题。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.

关 键 词：LUCAS序列 盲签名 大整数分解 

分 类 号：TN918.2[电子电信—通信与信息系统]