摘要
针对网络编码中的防窃听问题,基于最大秩距离(MRD)码,提出一种强安全线性网络编码算法。在本文算法中,源节点上的消息通过扩域上的MRD码的陪集编码方法进行预编码。同时,中间节点则采用基域上的线性网络码。理论上证明了本文算法可以将一个非安全线性网络码转换为一个强安全线性网络码,即它是一个一般化的强安全线性网络编码算法。与现有的强安全算法的对比表明,本文算法降低了中间节点上的编码域尺寸。
This paper focuses on the problem of eavesdropping adversaries in network coding field. Based on Maximum Rank Distance （MRD） codes, a new strongly secure linear network coding algorithm is proposed. In this algorithm, message is pre-encoded at the source node by using coset coding scheme that uses MRD code over extension filed. Meanwhile, focusing on the intermediate nodes, linear network code over the base field is used. It is proved that the proposed algorithm can transform a non-secure linear network code to a strongly secure code. In other word, the algorithm is a general strongly secure linear network coding algorithm. Also, the proposed algorithm can reduce the coding field size of intermediate code compared to current strongly secure algorithm.
出处
《吉林大学学报（工学版）》
EI
CAS
CSCD
北大核心
2013年第1期229-232,共4页
Journal of Jilin University:Engineering and Technology Edition
基金
国家自然科学基金项目(60832001
61271174)
ISN国家重点实验室专项基金项目(ISN01080202)
关键词
通信技术
线性网络编码
强安全
秩距离
窃听
communication
linear network coding
strongly secure
rank-distance
eavesdropping
