نتایج جستجو برای: pair wise least significant bit matching
تعداد نتایج: 1779437 فیلتر نتایج به سال:
For watermarking of the digital grayscale image its Gray planes have been used. With the help of the introduced representation over Gray planes the LSB embedding method and detection have been discussed. It found that data, a binary image, hidden in the Gray planes is more robust to JPEG lossy compression than in the bit planes.
Various Steganography algorithms have been proposed and implemented for hiding the existence of data in a cover object starting from the algorithms that work in transform domain to the ones that work in spatial domain, such as Least Significant Bit (LSB), which uses the three colours (RED, GREEN and BLUE) present in an image. Three colours are present in the pixel of an image, therefore, this p...
This paper studies the statistical detection of data hidden in the Least Significant Bits (LSB) plan of natural clipped images using the hypothesis testing theory. The main contributions are the following. First, this paper proposes to exploit the heteroscedastic noise model. This model, characterized by only two parameters, explicitly provides the noise variance as a function of pixel expectat...
Plus minus 1 (PM1) is an improved method to least significant bits (LSB)-based steganography techniques, which not only foils typical attacks against LSB-based techniques, but also provides high capacity. But how to apply it to JPEG images does not appear in literatures. In this paper, PM1 steganography in JPEG images using genetic algorithm (GA) is proposed, in which the GA is used to optimize...
In this paper, we describe a new methodology to separate photographs and computer generated images . We introduce the Progressive Randomization (PR) technique that captures the statistical properties of each one of these classes. Using only statistical descriptors of the least significant bit (LSB) occurrences, our method already performs as well or better than some comparable existing techniqu...
LSBS-RSA is a variation of RSA cryptosystem with modulus primes p, q, sharing a large number of least significant bits. As original RSA, LSBS-RSA is also vulnerable to the short secret exponent attack. Sun et al. [15] studied this problem and they provided the bound for secret exponent as: 2 2 5 4 3 1 6 1 3 6 3 2 2 6 γ β α α γ α − < + − + − − . Their bound does not reduce to the opt...
There are many detectors for simple Least Significant Bit (LSB) steganography in digital images, the most sensitive of which make use of structural or combinatorial properties of the LSB embedding method. We give a general framework for detection and length estimation of these hidden messages, which potentially makes use of all the combinatorial structure. The framework subsumes some previously...
The Least Significant Bit (LSB) substitution is an old and simple data hiding method that could almost effortlessly be implemented in spatial or transform domain over any digital media. This method can be attacked by several steganalysis methods, because it detectably changes statistical and perceptual characteristics of the cover signal. A typical method for steganalysis of the LSB substitutio...
This paper is an extension of our work on stego key search for JPEG images published at EI SPIE in 2004. We provide a more general theoretical description of the methodology, apply our approach to the spatial domain, and add a method that determines the stego key from multiple images. We show that in the spatial domain the stego key search can be made significantly more efficient by working wit...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید