In this paper we present an LSB steganalysis technique that can detect the existence of hidden messages that are randomly embedded in the least significant bits of natural continuous-tone images. The technique is inspired by recent work of Fridrich et al. [1] and just like [1], it can also precisely measure the length of the embedded message, even when the hidden message is very short relative ...

In this paper, an efficient data hiding technique based on the discrete cosine transform (DCT) of image is proposed. In this technique, the DCT coefficient is quantized using a predefined mathematical operation then the secret bits are embedded in all frequency component of the quantized DCT coefficient using least significant-bit (LSB) to enable a large message capacity. A comparison between t...

We compute lower bounds for the Morse index and nullity of constant mean curvature tori of revolution in the three-dimensional unit sphere. In particular, all such tori have index at least five, with index growing at least linearly with respect to the number of the surfaces’ bulges, and the index of such tori can be arbitrarily large.

Hiding data is a very important thing nowadays as the data travels over various unsecure networks. To avoid this problem cryptography is used which hides the data or scrambles your message, but cryptography alone cannot provide total security as the message is still available to perform cryptanalysis. Steganography hides the existence of the message. Most of the peoples use either cryptography ...

Any Universal Steganalysis algorithm developed should be tested with various stego-images to prove its efficiency. This work is aimed to build the stegoimage database which is obtained by implementing various RGB Least Significant Bit Steganographic algorithms. Though there are many stego-images sources available on the internet it lacks in the information such as how many rows has been infecte...