This paper introduces a new steganographic technique for secret data communication based on Public Key Digital Image steganography by combining public key cryptography with Digital Image Steganography. The proposed scheme employs RSA algorithm with 1024 bits key size for secret data encryption before inserting it into cover image and F5 steganographic technique to hide the encrypted message inside the cover image imperceptibly. The F5 algorithm embeds the message into randomly chosen Discrete Courier Transform (DCT) coefficients. By employing matrix embedding which minimizes the changes to be made to the length of certain message, it provides high Steganographic capacity, faster speed and can prevent visual and statistical attacks. The encryption key used in message encryption is big enough to thwart known cryptanalytic attacks. Experiments suggest that the stego image and cover images are perceptually similar. Further, the stego images are robust against image processing distortions.
In the present era of Internet multimedia data especially Images and Videos are the most widely used digital format for data transmission. However due to their large data sizes and constraint of low bandwidth capacity of communication channel it is very difficult to transmit them at optimum speed maintaining the signal quality. Compression therefore, is a vital tool that not only reduces the data size thereby leading to faster data transmission but also protects it to some extent from transmission errors. A large variety of Image and Videos compression techniques are employed each having their own strengths and weaknesses. This paper is an effort to present an overview of image and video compression techniques, their working and comparison.
Steganography is an information security approach used to hide messages inside suitable covers in such a way that it is not known to attackers. The cover files may be any digital data including Image or Audio files. For steganography several methods exists where each of them has some advantages and disadvantages. Steganographic applications have varying requirements depending upon the steganography technique used. In this paper we present an overview of image steganography and steganalsysis, its uses and techniques. It also attempts to identify the requirements of a good steganographic algorithm and compares their performance with respect to requirements.
This paper proposes a novel compression combined digital image watermarking scheme based on singular value replacement technique. Image compression is achieved using Huffman encoding technique. Huffman encoding is an entropy encoding algorithm offering lossless image compression. The proposed watermarking scheme combines Integer wavelet transform (IWT) with singular value decomposition (SVD). For watermark embedding, the singular values (SV's) of high frequency (CD) band of cover images are replaced with the singular values of watermark signal. Choosing a sample image as watermark signal depends on the relation between energy of singular value of high frequency component of cover and sample image. The combination of Huffman encoding with IWT-SVD domain watermarking results in a robust watermarking scheme that provides good compression ratio with better signal quality. Experiments suggest that the watermarked and original images are perceptually similar. Also, watermarked images are robust against image processing distortions and geometrical attacks. Further, the recovered images are distortion free.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.