A New Method of Coding for Steganography Based on LSB Matching Revisited

Abstract

LSB matching revisited is an LSB-based approach for image steganography. This method is a type of coding to increase the capacity of steganography. In this method, two bits of the secret message are hidden in two pixels with only one change. But this method provides no idea for hiding a message with a large number of bits. In other words, this method works only for n = 2 , where n is the number of bits in a block of the secret message. In this paper, we propose an improved version of the LSB matching revisited approach, which works for n > 2 . The proposed scheme contains two phases including embedding and extracting the message. In the embedding phase, we first convert the secret message into a bit-stream, and then the bit-stream is divided into a set of blocks including n bits in each block. Then we choose 2 n − 1 pixels for hiding such n bits of the secret message. In the next step, we choose the operations needed to generate such a message. Finally, we perform the obtained operations over the coefficients to hide the secret message. The proposed approach needs fewer changes than LSB MR when n > 2 . The capacity of the proposed approach is 2 n − 1 / 2 n − 1 − 1 × 100 % higher than the F5 method where this value for n > 2 is bigger than 75%. For example, the capacity of our scheme is 75% higher than the capacity of F5 for n = 3 . The proposed method can be used in the first step of every steganography method to reduce the change in the stego image. Therefore, this method is a new coding method for steganography. Our experimental results using steganalysis show that using our method provides around 10% higher detection error for SRNet over two steganography schemes.

Enhancing Data Security of Cloud Based LMS

“…In the implantation phase of a steganography technique, the secret message is first separated into n bit groups, and then 2n 1 pixels of the source images are used to obscure every one of these groups. To limit the alteration in the stego image, the coding approaches can be utilized in the first phase of each steganography method [ 13 ]. Errors are not determined here,advantages are depicted below.…”

“…To improve data security in cloud data centres, the author has proposed a method to guarantee data protection in “cloud computing” by encrypting private documents utilizing two levels of encryption, DES and RSA algorithms, and then using the LSB algorithm to hide such encrypted data inside the edges of colour images, a technique known as steganography. The author of paper [ 13 ] describes an LSB-based technique for image steganography called LSB matching revisited. The approach is a sort of coding that boosts steganography’s capability.…”

Review on Common Steganography Techniques

“…The idea of the system proposed by Mansoor Fateh [18] depends on dividing the series of bits of confidential data into groups of n bits and then select 2n− 1 location from cover image to hiding each group. The researchers Rusul Mohammed Neamah et al [19] introduced a hiding system that includes as a first step encrypting secret data using the X-Nor process and then passing it to the next step to be hidden through the second bit test for RPG channels: if the remainder of the division bit on 3 is 0 (Choose the red channel), if the remainder is 1 (Choose the green channel) and if the remainder is 2( the chosen channel is blue).…”

High Security and Robustness Image Steganography Based On Ant Colony Optimization Algorithms and Discrete Cosine Transform

“…While spatial domain techniques offer large capacity and are frequently used in steganography, frequency domain procedures are reliable and frequently utilized for watermarking. [3].…”