摘要
根据Lucas序列的特点 ,设计了一种新的盲签名方案 ,其安全性是基于大数分解问题的 .该方案签名和验证过程简单 ,通信成本低 。
A new blind signature scheme based on Lucas sequences is presented, the security of which is based on computing factoring problem. The signature and verifying stages of this scheme are simple, and it has lower communication costs, therefore the scheme is practical. [
出处
《暨南大学学报（自然科学与医学版）》
CAS
CSCD
2000年第5期51-53,共3页
Journal of Jinan University(Natural Science & Medicine Edition)
基金
国家自然科学基金!(6 98730 2 0 )
广东省科学基金!(980 6 90 )
暨南大学博士启动基金!(6 0 0 0 90 )
