Investigation of the influence of a template matrix on the embedding of information in an image

Authors

  • Dimitar Todorov Technical University of Varna, Department of Computer Science and Engineering, 9010, 1 Studentska Street, Varna, Bulgaria
  • Zheyno Zheynov Technical University of Varna, Department of Computer Science and Engineering, 9010, 1 Studentska Street, Varna, Bulgaria
  • Hristo Valchanov Technical University of Varna, Department of Computer Science and Engineering, 9010, 1 Studentska Street, Varna, Bulgaria
  • Milena Karova Technical University of Varna, Department of Computer Science and Engineering, 9010, 1 Studentska Street, Varna, Bulgaria
  • Ivaylo Plamenov Penev Технически университет - Варна

DOI:

https://doi.org/10.29114/ajtuv.vol5.iss2.234

Keywords:

steganography, template, matrix, message length

Abstract

Steganography is a modern approach to protect classified data against malicious attacks and misuse. Presented, accordingly, in this paper is a novel method for steganographic embedding of information. A template matrix is used for screening the original message embedded in an image. The efficiency of the steganographic embedding depends on the length of the message. The particular dependency is, therefore, the primary focus of the proposed work. The end results of the experiment were extremely satisfactory with the percentage of successfully retrieved messages being more than 90%, and the size of the processed images with embedded messages being fully acceptable and capable of being used in a communication environment.

Downloads

Download data is not yet available.

References

<p>Grebennikov, V. V. (2019). Steganography. History of cryptography, LitRes, (pp. 66-69). (in Russian)<br />&nbsp;<br />Gribunin, V. G., Kokov, I. N. &amp;Turintcev I.V. (2009). Digital stenography, Moscow: SOLON-PRESS. (in Russian)<br />&nbsp;<br />Fridrich, J. (2010). Steganography in Digital Media: Principles, Algorithms, and Applications. Cambridge University Press, ISBN 978- 0521190190<br /><a href="https://doi.org/10.1017/CBO9781139192903" target="_blank">Crossref</a><br />&nbsp;<br />Fridrich, J. (2004). Steganography II. In International Multimedia Conference: Proceedings of the 2004 workshop on Multimedia and security, 2004.<br />&nbsp;<br />Kruus, P., Scace, C., Heyman, M., &amp; Mundy, M. (2003). A survey of steganography techniques for image files. Advanced Security Research Journal. 5(1), 41-52.<br />&nbsp;<br />Kordov, K. &amp; Stoyanov, B. (2017). Least Significant Bit Steganography using Hitzl-Zele Chaotic Map. International Journal of Electronics and Telecommunications, 63(4), 417-422.<br /><a href="https://doi.org/10.1515/eletel-2017-0061" target="_blank">Crossref</a><br />&nbsp;<br />Rani, N. &amp; Chaudhary, J. (2013). Text Steganography Techniques: A Review. International Journal of Engineering Trends and Technology (IJETT),4(7).<br />&nbsp;<br />Neil, F. &amp; Johnson, S. J. (1998). George Mason University, "Exploring Steganography: Seeing the Unseen", IEEE Computers, 26-34.<br /><a href="https://doi.org/10.1109/MC.1998.4655281" target="_blank">Crossref</a><br />&nbsp;<br />Ross, J., &amp; Petitcolas, F.A.P. (1998). On the limits of steganography. IEEE Journal of Selected Areas in Communications, 16(4),474-481. May 1998. Special Issue on Copyright &amp; Privacy Protection. ISSN 0733-8716.<br /><a href="https://doi.org/10.1109/49.668971" target="_blank">Crossref</a><br />&nbsp;<br />Nain, S. &amp; Kumar, S. (2014) Steganography and Its Various Techniques. International Journal of Enhanced Research in Science Technology &amp; Engineering, 3(6),241-245. ISSN: 2319-7463<br />&nbsp;<br />Stanev, S. &amp; Szczypiorski, K. (2016). Steganography Training: A Case Study from University of Shumen in Bulgaria. International Journal of Electronics and Telecommunications, 62(3), 315-318.<br /><a href="https://doi.org/10.1515/eletel-2016-0043" target="_blank">Crossref</a><br />&nbsp;<br />Stanev, S., Zhelezov, S. &amp; Yakimov, I. (2012). An approach for parallel steganalysis based on data compression. In Proceedings of Jubilee International Congress, 40, 360-367.<br />&nbsp;<br />Stoyanov, B. P., Zhelezov, S. K. &amp; Kordov, K. M. (2016). Least significant bit image steganography algorithm based on chaotic rotation equations. Comptes rendus de l'Academie bulgare des Sciences, 69(7), 845-850.<br />&nbsp;<br />Lokhande, U. (2014). An Effective Way of using LSB Steganography in images along with Cryptography. International Journal of Computer Applications, 88(12)<br /><a href="https://doi.org/10.5120/15406-3902" target="_blank">Crossref</a><br />&nbsp;<br />Zhelezov, S. (2016). Modified Algorithm for Steganalysis. Mathematical and Software Engineering, 1(2), 31-36.<br />&nbsp;<br />Zhelezov, S. &amp; Paraskevov, H. (2015). Possibilities for steganographic parallel processing with a cluster system. Contemporary Engineering Sciences, 8(20).<br /><a href="https://doi.org/10.12988/ces.2015.58230" target="_blank">Crossref</a></p>

Downloads

Published

2021-12-31

How to Cite

Todorov, D., Zheynov, Z., Valchanov, H., Karova, M., & Penev, I. P. (2021). Investigation of the influence of a template matrix on the embedding of information in an image. ANNUAL JOURNAL OF TECHNICAL UNIVERSITY OF VARNA, BULGARIA, 5(2), 140–145. https://doi.org/10.29114/ajtuv.vol5.iss2.234

Issue

Vol. 5 No. 2 (2021): Annual Journal of Technical University of Varna

Section

INFORMATION TECHNOLOGIES, COMMUNICATION AND COMPUTER EQUIPMENT

License

            PUBLICATION AGREEMENT

           Annual Journal of Technical university of Varna (AJTUV) aims to guarantee that original material is published while at the same time giving significant freedom to our authors. For that matter, we uphold a flexible copyright policy meaning that there is no transfer of copyright to the publisher and authors retain exclusive copyright to their work.

           When submitting a manuscript the Corresponding Author is required to accept the terms and conditions set forth in our Publication Agreement as follows:

            CORRESPONDING AUTHOR'S GRANT OF RIGHTS
            The Corresponding Author grants to AJTUV, during the full term of copyright and any extensions or renewals of that term the following:
      • An irrevocable non-exclusive right to publish, reproduce, republish, transmit, distribute and otherwise use the Work in electronic and print editions of the publication and in derivative works throughout the world, in all languages, and in all media now known or later developed.
      • An irrevocable non-exclusive right to create and store electronic archival copies of the Work, including the right to deposit the Work in open access digital repositories.
      • An irrevocable non-exclusive right to license others to reproduce, translate, republish, transmit and distribute the Work under the condition that the Authors are attributed (Currently this is carried out by publishing the Work under a Creative Commons Attribution 4.0 Unported License).
           Copyright in the Work remains with the Authors. Authors retain patent, trademark and other intellectual property rights.

           CORRESPONDING AUTHOR'S DUTIES
           When distributing or re-publishing the Work, the Corresponding Author agrees to credit the AJTUV in which the Work is published as the source of first publication. Corresponding Author warrants that Co-authors will also credit the AJTUV in which the Work is published as the source of first publication when they are distributing or re-publishing the Work. 

           CORRESPONDING AUTHOR'S WARRANTY
           The Corresponding Author represents and warrants that the Work does not violate or infringe the law or the rights of any third party and, specifically, that the Work contains no matter that is defamatory or that infringes any literary or proprietary rights, intellectual property rights, or any rights of privacy. The Corresponding Author warrants that the Work is original, has not been formally published in any other peer-reviewed journal or in a book or edited collection, and is not under consideration for any such publication. The Corresponding Author also warrants that he or she has the full power to make this agreement. If the Work was prepared jointly the Corresponding Author warrants that all Co-authors consent to the submission and publication of the Work.

            The Corresponding Author agrees to hold AJTUV harmless from any breach of the aforestated representations and warranties.

           AJTUV DUTIES AND RIGHTS
AJTUV agrees to publish the Work attributing it to its Authors. AJTUV is granted the authority to enforce the rights from this agreement, on behalf of the authors, against third parties (for example in cases of plagiarism or copyright infringements).

           AJTUV's Privacy Statement
       The names and email addresses entered in the AJTUV website will be used only and exclusively for the stated purposes of this annual journal and will not be made available for any other purpose or to any other party.
       All personal information supplied will remain within publisher and will not be shared with any external entity unless prior permission is given.
       Your personal information will not be sold, distributed or published in any manner whatsoever.

Similar Articles

You may also start an advanced similarity search for this article.