检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:徐光宪[1] 王栋 XU Guangxian;WANG Dong(School of Electronics and Information Engineering, Liaoning Technical University, Huludao Liaoning 125105, China)
机构地区:[1]辽宁工程技术大学电子与信息工程学院,辽宁葫芦岛125105
出 处:《计算机应用》2019年第5期1374-1377,共4页journal of Computer Applications
基 金:国家科技支撑计划项目(F2013BAH12F00);辽宁省高等学校杰出青年学者成长计划项目(LJQ2012029)~~
摘 要:针对抗窃听安全网络编码中引入额外带宽开销且计算复杂度高的问题,提出了一种基于双混沌序列的加密方案。首先,通过Cat-Logistic混沌序列对信源消息的第一维数据进行加密;然后,利用加密后的数据构造出稀疏预编码矩阵。最后,通过预编码矩阵对剩余的明文向量进行线性随机混合,从而达到对抗窃听的目的。与安全实用网络编码(SPOC)方案相比,该方案通过信源消息构造稀疏预编码矩阵没有引入额外信源编码冗余,降低了带宽开销。理论分析和实验结果表明,该方案降低了编码复杂度,提高了传输效率,有效增强网络安全性和传输效率。Focused on the problems of extra bandwidth overhead and high computational complexity to realize secure network coding against wiretapping, a secure networking coding scheme based on double chaotic sequences was proposed. Firstly, the first-dimentional data of source information was encrypted by using Cat-Logistic sequence. Then, sparse pre-coding matrix was constructed by the encrypted data. Finally, the rest vectors were linearly and randomly mixed up with the pre-coding matrix, realizing anti-wiretapping. Compared with the traditional Secure Practical netwOrk Coding(SPOC) scheme, the proposed scheme does not indroduce extra source coding redundancy by constructing sparse pre-coding matrix, reducing bandwidth overhead. The theoretical analysis and experimental results show that the proposed scheme not only has lower coding complexity but also improves network security and the transmission efficiency.
关 键 词:网络编码 抗窃听 混沌序列 预编码矩阵 稀疏矩阵
分 类 号:TP309.7[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145