Autores
Soria-Lorente Anier(a),(b), Stefan Berres(b).
Información de los Autores
(a)Department of Basic Sciences, Granma University, Bayamo, Cuba.
(b)Departamento de Ciencias Matemáticas y Físicas, Casilla 15 D, Universidad Católica de Temuco, Temuco, Chile.
SECURITY AND COMMUNICATION NETWORKS.
Volunen: 2017 Páginas: 1-14
DOI: https://doi.org/10.1155/2017/5397082
Fecha de Publicación: 01 de Marzo de 2017
Abstract
This contribution proposes a novel steganographic method based on the compression standard according to the Joint Photographic Expert Group and an Entropy Thresholding technique. The steganographic algorithm uses one public key and one private key to generate a binary sequence of pseudorandom numbers that indicate where the elements of the binary sequence of a secret message will be inserted. The insertion takes eventually place at the first seven AC coefficients in the transformed DCT domain. Before the insertion of the message the image undergoes several transformations. After the insertion the inverse transformations are applied in reverse order to the original transformations. The insertion itself takes only place if an entropy threshold of the corresponding block is satisfied and if the pseudorandom number indicates to do so. The experimental work on the validation of the algorithm consists of the calculation of the peak signal-to-noise ratio (PSNR), the difference and correlation distortion metrics, the histogram analysis, and the relative entropy, comparing the same characteristics for the cover and stego image. The proposed algorithm improves the level of imperceptibility analyzed through the PSNR values. A steganalysis experiment shows that the proposed algorithm is highly resistant against the Chi-square attack.