版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Univ Coll Engn Tindivanam Dept Comp Sci & Engn Melpakkam 604001 India Anna Univ CEG Dept Comp Sci & Engn Chennai 600025 Tamil Nadu India
出 版 物:《JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY》 (J. Discrete Math. Sci. Cryptography)
年 卷 期:2014年第17卷第5-6期
页 面:435-442页
核心收录:
学科分类:07[理学] 0701[理学-数学] 070101[理学-基础数学]
主 题:Digital Signature Algorithm Batch signature Multiplicative Inverse operation Computation Time Latency Time
摘 要:Providing a secure multicast authentication algorithm with minimal computation time is a challenging issue. In order to avoid computationally expensive signature and verification operations on each packet of multicast data, most of the existing schemes divide a multicast stream into blocks, associate each block with a signature, and spread the effect of the signature across all the packets in the block through hash chains or codes. In this paper, we propose a new batch signature and verification algorithm called VDSA (Vijay batch Digital Signature Algorithm) which is based on the idea of the existing HDSA (Harn batch Digital Signature Algorithm). VDSA mainly reduces the computation time of both signature generation and verification operation. We have implemented our proposed multicast authentication algorithm using the existing Merkle tree approach. Comparative analysis to illustrate the performance of various multicast authentication schemes is shown and it has been observed that the proposed algorithm reduces the computation complexity considerably thereby reducing the latency time.