Search

Steganography methods are considered to be one of the most common technologies for the protection of any digital data when transmitted over open communication channels at a given time. The solution of the problem of digital data protection using steganography methods is used not only by government services, but also by terrorist organizations. Therefore, the need for research, development and continuous improvement of steganoanalytical methods is becoming extremely important. The steganoanalytical algorithm based on the study of the singular decomposition of digital image matrix blocks is proposed in the paper. The main purpose of this paper is to increase the efficiency of digital image steganoanalysis, in the absence of a container, by developing a new steganoanalytical algorithm based on the study of the singular decomposition of digital image matrix blocks. As a result of a detailed study of the steganography algorithm using the singular decomposition of digital image matrix blocks, the statistical characteristics of the singular values of image matrix blocks are established. Based on the defined characteristics, the paper presents the main steps of the stegananoanalytical algorithm. As a criterion for assessing the effectiveness of the developed steganoanalytical algorithm, the probability of detecting additional information was used. Errors of the first and second type are considered. To compare the results of the developed steganoanalytical algorithm with existing algorithms in open access, the following applications are selected: XSteg; StegSpy. The software product "StegoAnalysis" has been implemented for the automated solution of the stegananalytical problem for digital image. [ABSTRACT FROM AUTHOR]

At a time when the use of digital content in all spheres of life is constantly growing, the ability to verify the authenticity of digital files, in particular digital images, is extremely important in protecting information from integrity violations. In the information war, photo fakes are always used to achieve certain, often criminal, goals. Both society as a whole and individuals must take care of information security and protect their information space from unverified information. Modern methods of detecting violations of the integrity of graphic information to some extent address some issues of information security, however, they are not universal and often require development, improvement, additional research and so on. Thus, existing methods for detecting such a common method of image falsification as scaling are effective only in cases where the falsified part is enlarged, however, when reducing part of the image, they are not effective. Moreover, in open printing the problem of detecting reduced scalable parts of the image is not covered. Therefore, the aim of this work is to increase the efficiency of scaling detection as digital image falsification by developing an algorithm for detecting scaling with a negative coefficient. In this paper, the method of error level analysis is adapted to detect reduced parts of the digital image. The efficiency of the adapted method in terms of errors of the 1st and 2nd kind was: errors of the 1st kind - 2%, 2nd kind - 7%. In addition, it has been found that this method is also effective in detecting simultaneously scalable (reduced) and moved parts of a digital image. This method detects artifacts (errors) in the digital image, which occur when reducing its part - the falsified area has a higher high-frequency component than the rest of the image, which is amplified under the influence of compression after saving the falsification in a lossy format. [ABSTRACT FROM AUTHOR]

The protection of electronic information by cryptographic and steganographic methods, as well as their combination, is in great demand today. However, the new type of steganography - hash-steganography, fundamentally differs from classical steganography in that there is no need to embed messages in a container, no need to worry about the amount of information that can be transmitted in one container without compromising the visual stability of the image. A certain sequence of ordinary digital images is a message. The purpose of this work is to increase the efficiency of transmitting a secret message by modifying the hash-method of steganography. Previously, algorithms for obtaining hash functions of digital images have not been used to transmit messages, but they have found their application in hash-steganography. This paper compares two algorithms for obtaining hash codes and suggests a method of their application for transforming a text message into a sequence of digital images. It is a certain order of files transferred that is decisive in the decryption of a message. The symbols of the message are put in correspondence with the part of the hash code of the digital image. Thus, the necessary combination of files is formed, the number of which is equal to the number of symbols in the message. A comparative analysis of the two algorithms of the method has been performed. The results obtained have confirmed the effectiveness of the hash code algorithm based on the analysis of digital image DCT coefficients. This algorithm makes the method resistant to attack by compression, changing brightness and contrast, magnification and rotation. [ABSTRACT FROM AUTHOR]

This paper is devoted to steganalysis algorithm determining presence a secret message embedded into digital image which is stored in compressed or uncompressed form. The algorithm is based on the analysis of pairs of colors and uses the method of modifying the least significant bit. [ABSTRACT FROM AUTHOR]