基于Merkle可信树的DTN网络分片认证研究  

Research on Certification of DTN Network Fragmentation Base on Merkle Certification Tree

作　　者：许宁[1] 边巴旺堆[1] 许亮 

机构地区：[1]西藏大学工学院 [2]西藏自治区地震局信息网络部,西藏拉萨850000

出　　处：《西藏大学学报（社会科学版）》2012年第2期76-79,共4页Journal of Tibet University

基　　金：国家自然科学基金项目"基于国际编码标准的藏文词语排序算法研究"阶段性成果;项目号:61163013

摘　　要：DTN网络的工作环境决定了传统的安全认证机制无法使用,现有的认证算法存在着持续时间过长,对DTN网络的存储与通信资源占用过大、使用条件苛刻等诸多缺陷。文章主要以Merkle可信树为基础,通过研究DTN(Delay/Disrupted Tolerant Networks,容断容延迟网络)中的安全分片认证机制,结合身份认证机制,设计了一套适用于DTN网络的分片认证算法。该算法在性能表现上优于现有算法,具有较高的实用价值。The working environment of the DTN network determines the unusable of traditional security authentication mechanism. The existing authentication algorithm has many defects such as long duration, DTN network storage and communication resources occupying large space and strict using condition and so on. In the present paper, a set of authentication algorithm of the DTN network chip was designed mainly based on Merkle certification the tree by studying the DTN （Delay / Disrupted Tolerant Networks, Yung-off delay network capacity） network security authentication mechanism combining with the authentication mechanism, The alaorithm performance is suoerior to existin~ algorithms with a high oractieal value.

关 键 词：容断容延迟网络 分片认证 Merkle可信树 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]