Design of Information Hiding Algorithm for Multi-Link Network Transmission Channel
Design of Information Hiding Algorithm for Multi-Link Network Transmission Channel
复制标题
DOI：
10.17576/jsm-2019-4812-21
复制
发表时间：
2019-12
期刊：
影响因子：
0.8
通讯作者：
Songyin Fu;Rangding Wang
中科院分区：
文献类型：
--
作者：
Songyin Fu;Rangding Wang
传统的基于m序列的多链路网络传输信道信息隐藏算法，将m序列应用于信道编码信息隐藏系统，没有分析多链路网络传输信道系统隐藏容量的上限，也没有考虑嵌入秘密信息过大时秘密信息重叠的隐患。其存在效率低、精度差、存储成本大的缺陷。设计了一种基于二次定位的多链路网络传输通道信息隐藏算法，利用RS码M公钥密码体制对秘密信息进行预处理，提高信息的安全性；通过信息隐藏容量分析模型计算多链路网络传输通道系统的隐藏容量上限，并判断隐藏容量是否超过秘密信息。引入二次定位和循环移位机制，提高位置选择的随机性，避免秘密信息重叠。实验结果表明，该算法在内存消耗上具有很大的优势。当信道SNR为0dB和8dB时，归一化系数分别为0.87和1.04。这表明该算法在提取秘密信息方面具有较高的准确率。隐藏信息的平均时间为2.04 s，表明该算法具有较高的信息隐藏率和存储效率。
Traditional channel information hiding algorithms based on m-sequence for multi-link network transmission, which apply m-sequence to channel coding information hiding system, do not analyze the upper limit of hiding capacity of multi-link network transmission channel system, and do not consider the hidden danger of overlapping secret information when embedding secret information is too large. It has the defects of low efficiency, poor accuracy and large storage cost. This paper designs an information hiding algorithm for multi-link network transmission channel based on secondary positioning, it uses RS code M public key cryptosystem to pre-process secret information and improve the security of information; calculates the upper limit of hiding capacity of multi-link network transmission channel system through information hiding capacity analysis model, and determines whether the hiding capacity exceeds the secret information. Secondary location and cyclic shift mechanism are introduced to improve the randomness of location selection and avoid overlapping of secret information. The experimental results show that the proposed algorithm has a great advantage in memory cost. When the channel SNR is 0 dB and 8 dB, the normalization coefficients are 0.87 and 1.04, respectively. This shows that the algorithm has a high accuracy in extracting secret information. The average time spent on hiding information is 2.04 s, indicating that the algorithm has high information hiding rate and storage efficiency.