Fast Matrix Embedding Based on Random Linear Code

GAO Zhan-zhan; WEI Da-wei; TANG Guang-ming; LI Xiao-li

doi:10.3969/j.issn.0372-2112.2017.05.017

您当前的位置：

首页 >

文章列表页 >

Fast Matrix Embedding Based on Random Linear Code

更新时间：2025-07-16

- Fast Matrix Embedding Based on Random Linear Code
- Acta Electronica Sinica Vol. 45, Issue 5, Pages: 1139-1149(2017)
- 作者机构：
  
  1. 解放军信息工程大学,河南,郑州,450001
  2. 中国洛阳电子装备试验中心,河南,洛阳,471000
  3. 解放军信息工程大学,河南,郑州,450001
  4. 中国洛阳电子装备试验中心,河南,洛阳,471000
- 作者简介：
- 基金信息：
  
  National Natural Science Foundation of China (No.61272488);Key Technology Research and Development Program of Henan Province (No.122102210047);PLA Military Science Postgraduate Project (No.2015JY125)
- DOI：10.3969/j.issn.0372-2112.2017.05.017
  CLC： TP309
- Published Online：25 May 2017，
  
  Published：2017
- 稿件说明：
移动端阅览
GAO Zhan-zhan, WEI Da-wei, TANG Guang-ming, et al. Fast Matrix Embedding Based on Random Linear Code[J]. Acta Electronica Sinica, 2017, 45(5): 1139-1149.
DOI：

GAO Zhan-zhan, WEI Da-wei, TANG Guang-ming, et al. Fast Matrix Embedding Based on Random Linear Code[J]. Acta Electronica Sinica, 2017, 45(5): 1139-1149. DOI： 10.3969/j.issn.0372-2112.2017.05.017.

摘要

矩阵嵌入将编码思想引入隐写过程，用病灶携带秘密信息，通过寻找校验矩阵的陪集首确定最小修改向量，提高隐写安全性.如何以较低的计算复杂度找到陪集首是矩阵嵌入设计的核心.针对小嵌入率下的隐写，该文讨论了将汉明码矩阵引入到随机线性码矩阵的可行性，进而提出了一种新的校验矩阵结构.在此基础上，以一定的计算复杂度限制为前提，以最大化嵌入效率为目标，给出了矩阵的最优化构造方法.实验结果表明，新方法相比已有矩阵嵌入方法在嵌入效率和嵌入速度上都有所提高，适合实时性要求高的隐写应用.

Abstract

Matrix embedding (ME) encodes cover objects and secret messages with an error correction code and modifies the cover data according to the coding result.The modification vector is the coset leader of error correction codes and the messages are conveyed by the syndrome.How to find the coset leader with lower computational complexity is the core of ME design.To improve the embedding efficiency and embedding speed of small payloads ME

this paper discusses the feasibility of introducing Hamming codes into the parity check matrix (PCM) of random linear codes

and proposes a new PCM structure.On this basis

an optimization scheme is proposed which can adaptively generate a PCM to accommodate to the given cover length and provide the best performance while guaranteeing the desired computational complexity.Experimental results show that this new method achieves higher embedding efficiency and faster embedding speed than previous fast ME methods

and is more suitable for real-time steganogaphic systems.

关键词

Keywords

references

Views

377

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Behavior Steganography in Social Networks Based on 0-1 Knapsack Algorithm

Steganography Based on Extended Sum and Difference Covering Set

Related Author

GAO Peng

CHAI Peng-xiang

LANG Jun

XIA Bing-bing

ZHAO Xian-feng

WANG Ming-sheng

Peng GAO

Peng-xiang CHAI

Related Institution

College of Computer Science and Engineering, Northeastern University

Institute of Information Engineering, Chinese Academy of Sciences

College of Computer Science and Engineering， Northeastern University

⁰