Consider RSA with N = pq, q < p < 2q, public encryption exponent e and private decryption exponent d. We first study cryptanalysis of RSA when certain amount of the Most Significant Bits (MSBs) or Least Significant Bits (LSBs) of d is known. The basic lattice based technique is similar to that of Ernst et al. in Eurocrypt 2005. However, our idea of guessing a few MSBs of the secret prime p subs...

This paper addresses the problem of detecting the presence of data hidden in digital media by the Least Significant Bit (LSB) matching scheme. In a theoretical context of known digital medium parameters, two important results are presented. First, the use of hypothesis testing theory allows the design of the Most Powerful (MP) test. Second, a study of the MP test provides the opportunity to ana...

Steganography is the art of hiding the fact that communication is taking place by hiding information in other information. In the field of Data Communication, Steganography play a major role. The transmission of information via the Internet may expose it to detect and theft. Some solution to be discussed is how to passing information in a manner that the very existence of the message is unknown...

This paper proposes a novel methodology to detect data hidden in the least significant bits of a natural image. The goal is twofold: first, the methodology aims at proposing a test specifically designed for natural images, to this end an original model of images is presented, and, second, the statistical properties of the designed test, probability of false alarm and power function, should be p...

The advantages of Least-Significant-Bit (LSB) steganographic data embedding are that it is simple to understand, easy to implement, and it results in stego-images that contain hidden data yet appear to be of high visual fidelity. However, it can be shown that under certain conditions, LSB embedding is not secure at all. The fatal drawback of LSB embedding is the existence of detectable artifact...

A new method is introduced for the least significant bit (LSB) image steganography in spatial domain providing the capacity of one bit per pixel. Compared to the recently proposed image steganography techniques, the new method called onethird LSB embedding reduces the probability of change per pixel to one-third without sacrificing the embedding capacity. This improvement results in a better im...

In recent years, the development in the deregulated electricity market structure increases the number of market participants thereby, creates the market more competitive. It is important for the independent power producer (IPP), independent system operator and bulk power customer to know and select the least cost transaction. In this paper, a method for selecting the optimal multi-nodal bilater...

In this paper, we present techniques to detect Least Significant Bit (LSB) steganography for images. Here, images can be hidden inside lower bits of the pixels of the cover image. We use image statistics to detect two cases when hidden image is stored as one big chunk (Simple Mode) or spread out(Shuffle Mode). The results are presented on a synthetically generated database of around 350 stegano...

We propose two efficient information hiding algorithms in the least significant bits of JPEG coefficients of images. Our algorithms embed information by modifying JPEG coefficients in such a way that the introduced distortion is minimized. We derive the expected value of the additional error due to distortion as a function of the message length and the probability distribution of the JPEG quant...

Let E/Fp be an elliptic curve, and G ∈ E/Fp. Define the Diffie–Hellman function as DHE,G(aG, bG) = abG. We show that if there is an efficient algorithm for predicting the LSB of the x or y coordinate of abG given 〈E, G, aG, bG〉 for a certain family of elliptic curves, then there is an algorithm for computing the Diffie–Hellman function on all curves in this family. This seems stronger than the ...