Using r-indiscernibility Relations to Hide the Presence of Information for the Least Significant Bit Steganography Technique

Abstract

The paper presents some preliminary results concerning modification of the least significant bit steganography method. Using r - indiscernibility relations one can embed some information in the container in a semi-random way, whereas it can be reconstructed in a deterministic way. The combination of bits of RGB Bytes allows the bits of information to be hidden by means of a fixed mask. Each Byte of a pixel that contains a fixed combination of bits indiscernible in the fixed ratio with the mask may store the bit of information in the least significant bit. The bits indiscernible in other ratios form random gaps that leads to hiding the presence of information. In the paper we have implemented some steganography systems to test our approach by hiding the image in a cover picture.