A coverless information hiding algorithm based on gradient matrix Online publication date: Mon, 18-May-2020
by Jianbin Wu; Chuwei Luo; Ziyang Kang; Shuangkui Ge; Yemin Xin
International Journal of Computational Science and Engineering (IJCSE), Vol. 22, No. 2/3, 2020
Abstract: A coverless information hiding algorithm based on gradient matrix is introduced in this paper. Firstly, we grid the sharpened gradient matrix of an image. Then we encode the spectral radius of the gridded matrix to construct the mapping relationship between the matrix eigenvalues and random numbers. In order to improve the efficiency and security of transmission, we process the information segment by BCH (31, 21) encoder, in which redundancy check bits are added to detect and recover the errors caused by the interference in communication, thus breaking the limit that the image library has to be shared between the sender and receiver. In the meantime, splicing strategy is adopted to reduce the difficulty of building image library with the length of information sequence increasing. As the experimental results show, this proposed algorithm has a strong robustness towards glitch attack, JPEG compression attack, etc. and has a great application value in high-level secret key communication.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook