Indexed by:
Abstract:
本文从椭圆曲线离散对数问题(ECELP)出发,针对现有的椭圆曲线数字签名算法(ECDSA),提出了两个基于椭圆曲线的多重签名方案,包括按序多重签名和广播多重签名,基于计算量和效率,又提出了另外一种椭圆曲线的广播多重签名.它们都满足数字签名的基本要求,并具有良好的安全性和实用性.
Keyword:
Reprint Author's Address:
Email:
Source :
网络安全技术与应用
ISSN: 1009-6833
Year: 2006
Issue: 8
Page: 85-87
Cited Count:
WoS CC Cited Count: 0
SCOPUS Cited Count:
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count: 3
Chinese Cited Count:
30 Days PV: 0
Affiliated Colleges: