摘要
描述了由ANSI于1999年颁布的椭圆曲线数字签名算法(ECDSA),给出了一个改进的椭圆曲线数字签名算法,进一步加快了运算速度,缩短了数字签名时间。结合Binary tree批量签名方案,设计了一种基于改进椭圆曲线签名算法的批量签名方案。签名方用一次签名动作完成对多个不同消息的签名,但计算复杂度几乎和单个消息签名相同。非相关接收方可以独立地对每一条消息进行认证,安全性和ECDSA相同。
This paper systematically describes the elliptic curve digital signature algorithm（ECDSA） published by ANSI in 1999, and presents an improved digital signature scheme based on elliptic curve cryptosystem. It shortens the time for digital signature, and accelerates the speed of the operation, A batch signature based on the improved elliptic curve digital signature algorithm is designed with binary tree batch signature. The scheme is able to sign many different messages simultaneously using almost the cost of one signature operation of the signer. The unrelated recipients can authenticate signed messages independently. The security of the scheme is the same as ECDSA,
出处
《计算机工程》
CAS
CSCD
北大核心
2007年第10期141-143,共3页
Computer Engineering
基金
山东省科技攻关基金资助项目(2002-276-022090104)
关键词
数字签名
ECDSA
二叉树
批量签名
椭圆曲线密码
Digital signature
ECDSA
Binary tree
Batch signature
Elliptic curve cryptography
