Theoretical foundations for constructing effective codewords for the code-controlled information embedding steganographic method
DOI:
https://doi.org/10.30837/rt.2021.4.207.02Keywords:
steganography, discrete cosine transform, Walsh-Hadamard transform, code-controlled information embedding, selectivity coefficientAbstract
Steganography is an important component of modern information security systems. At the same time, in the conditions of modern cyberspace, it is relevant to develop high-performance steganographic methods that would have a high level of resistance to possible attacks by compression, noise, and blur. One of such methods is the steganographic method with code-controlled information embedding, based on the idea of preliminary coding of the information being embedded using binary codewords, for which the transformants of the Walsh-Hadamard transform have the specified properties. A specific localization of disturbances in the Walsh-Hadamard transform domain of the container takes place because of the information embedding. In this paper, a theoretical basis has been formed for further improvement of the codewords used in the code-controlled information embedding steganographic method. It is shown that despite the fact that these codewords have an ideal effect only on a given transformant of the Walsh-Hadamard transform, they affect several transformants at once in the domain of the discrete cosine transform (DCT). The concept of the selectivity coefficient is introduced to estimate the level of selectivity of the impact on a given DCT transformant. It has been established that with an increase in the size of the blocks used, a tendency is observed to a decrease in the selectivity coefficient due to the presence of the “close neighbor” effect. This trend is conditioned by the involvement of the DCT transformants with similar frequencies that have similar resistance to possible attacks on the embedded message. In this case, the ratio of the sum of absolute values of low-frequency DCT transformants to the sum of absolute values of all other DCT transformants increases with the size of the codeword. In this paper it has been proven and practically confirmed that an increase in the size of a codeword leads to an increase in the resistance of the code-controlled information embedding steganographic method. Possible ways of further practical improvement of codewords used in the code-controlled information embedding steganographic method are theoretically substantiated.
References
Evsutin O., Melman A., Meshcheryakov R. Digital Steganography and Watermarking for Digital Images: A Review of Current Research Directions // IEEE Access, 2020. No. 8. P. 166589-166611. doi: 10.1109/ACCESS.2020.3022779
Zhu Z., Zheng N., Qiao T., Xu M. Robust Steganography by Modifying Sign of DCT Coefficients // IEEE Access, 2019. Vol. 7. P. 168613-168628. doi: 10.1109/access.2019.2953504
Bansal D., Chhikara R. An improved DCT based steganography technique // International Journal of Computer Applications. Vol. 102, No.14. P. 46-49. doi: 10.5120/17887-8861
Bao Z. et al. A robust image steganography based on the concatenated error correction encoder and discrete cosine transform coefficients // Journal of Ambient Intelligence and Humanized Computing. 2020. Vol. 11, No. 5. P. 1889-1901.
Rachmawanto E. H. et al.Secure image steganography algorithm based on dct with otp encryption // Journal of Applied Intelligent System, 2017. Vol. 2, No. 1. P. 1-11. doi: 10.33633/jais.v2i1.1330
Kadhim I. J., Premaratne P., Vial P. J. High capacity adaptive image steganography with cover region selection using dual-tree complex wavelet transform // Cognitive Systems Research. 2020. Vol. 60. P. 20-32.
Valandar M. Y. et al. An integer wavelet transform image steganography method based on 3D sine chaotic map // Multimedia Tools and Applications. 2019. Vol. 78, No. 8. P. 9971-9989.
Atta R., Ghanbari M. A high payload steganography mechanism based on wavelet packet transformation and neutrosophic set // Journal of Visual Communication and Image Representation. 2018. Vol. 53. P. 42-54.
Emad E. et al. A secure image steganography algorithm based on least significant bit and integer wavelet transform // Journal of Systems Engineering and Electronics. 2018. Vol. 29,No. 3. P. 639-649.
Melnik M.A. Compression-resistant steganographic algorithm // Information security. 2012. No. 2(8). P. 99-106.
Subhedar M. S., Mankar V. H. Secure image steganography using framelet transform and bidiagonal SVD // Multimedia Tools and Applications. 2020. Т. 79. №. 3. P. 1865-1886.
Chanu Y. J., Singh Kh. M., Tuithung T. A Robust Steganographic Method based on Singular Value Decomposition // International Journal of Information & Computation Technology, 2014. Vol. 4, No. 7. pp. 717-726.
Subhedar M. Image Steganography Using Ridgelet Transform and SVD. Proceedings of the International e-Conference on Intelligent Systems and Signal Processing. Springer, Singapore, 2022. P. 81-91.
Bhattacharyya S., Mondal S., Sanyal G. A Robust Image Steganography using Hadamard Transform. International Conference on Information Technology in Signal and Image Processing, Mumbai, 2013. P. 416-426.
Sheidaeian H., Zolfaghari B., Zobeiri M. An Efficient and Secure Approach to Multi-User Image Steganography Using CRC-Based CDMA. International Conference on Signal Acquisition and Processing. Singapore, 2011. Vol. 2. pp. 1-5.
Amirtharajan R., Rayappan J. B. B. Covered CDMA multi-user writing on spatially divided image. International Conference on Wireless Communication, Vehicular Technology, Information Theory and Aerospace &Electronic Systems Technology (Wireless VITAE), 2011. P. 1-5. doi: wirelessvitae.2011.5940912
Sneha P. S., Sankar S., Kumar A. S. A chaotic colour image encryption scheme combining Walsh–Hadamard transform and Arnold–Tent maps // Journal of Ambient Intelligence and Humanized Computing, 2020. Vol. 11, No. 3. P. 1289-1308. doi: 10.1007/s12652-019-01385-0
Kobozeva A. A., Horoshko V. A. Information security analysis. Kiev : Izd. GUIKT, 2009. 251 p.
Kostyrka O.V. Analysis on the benefits of spatial domain of cover image forsteganography transformation // Informatics and Mathematical Methods in Simulation.2013.No.3. P. 275-282.
Gribunin V. G., Okov I. N., Turintsev I. V. Digital steganography. M. : Solon-Press, 2009. 265 p.
Kobozeva A.A., Sokolov A.V. Robust Steganographic Method with Code-Controlled Information Embedding // ProblemeleEnergeticiiRegionale. 2021. Vol. 52, No. 4. P. 115-130.
Horadam K. J. Hadamard matrices and their applications. Princeton university press, 2012. 280 p.
NRCS Photo Gallery // United States Department of Agriculture. URL: https://www.nrcs.usda.gov/wps/portal/nrcs/main/national/newsroom/multimedia/
Prokhozhev N. N., Mikhailichenko O. V., and Korobeinikov A. G., Influence of external perturbations on DC coefficients of DCT matrices in grayscale images // Scientific and technical bulletin of information technologies, mechanics and optics. 2008. No. 56. P. 57-62.
Demmel J. Computational linear algebra. M. : Mir, 2001. 430 p.
Gantmakher F. R. Matrix Theory. M. : Nauka, 1966. 576 p.
Mazurkov MI Fundamentals of information transfer theory. Odessa : Science and Technology, 2005. 168p.
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish with this journal agree to the following terms:
1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
