首页 | 本学科首页   官方微博 | 高级检索  
     

一种基于二叉树结构与椭圆曲线的批量签名方案
引用本文:梁有进,朱芳来,王勇.一种基于二叉树结构与椭圆曲线的批量签名方案[J].现代计算机,2006,34(12):41-44.
作者姓名:梁有进  朱芳来  王勇
作者单位:桂林电子科技大学计算机系非线性控制与图像处理研究室,桂林541004
摘    要:基于RSA、DSA等传统算法的批量签名有消息数目的限制,性能也越来越不能满足需要.针对现有的批量签名算法大多基于RSA、DSA等传统算法的现状,本文提出了一种高效的基于二叉树结构与椭圆曲线的批量签名方案.该方案利用二叉树结构计算散列总值,而签名与认证算法采用椭圆曲线算法.方案相对基于RSA、DSA等传统算法的批量签名方案有速度快、安全性能高、存储空间小等优点,而且没有消息数目的限制.

关 键 词:数字签名  批量数字签名  椭圆曲线  二叉树结构
收稿时间:2006-09-20
修稿时间:2006-09-20

A Batch Signature Scheme based on Binary Tree and Elliptic Curve
LIANG You-jin,ZHU Fang-lai,WANG Yong.A Batch Signature Scheme based on Binary Tree and Elliptic Curve[J].Modem Computer,2006,34(12):41-44.
Authors:LIANG You-jin  ZHU Fang-lai  WANG Yong
Affiliation:Department of Computer Science, Guilin University of Electronic Technology, Guilin 541004 China
Abstract:The batch signature scheme based on traditional cryptographic algorithm, such as RSA/DSA, has limit of message number and its performance does not work well nowadays. We propose an efficient batch signature scheme based on binary tree and elliptic curve. The scheme uses binary tree strueture to get Hash total value. Its signing and verification process is based on elliptic curve cryptosystem. The scheme has improvements on efficiency, security and storage space compared to the batch signature scheme based on traditional cryptographic algorithm. Furthermore the scheme has no limit of message number.
Keywords:Digital Signature  Batch Signature  Elliptic Curve  Binary Tree Structure
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号