Novel Steganography System using Lucas Sequence

Steganography is the process of embedding data into a media form such as image, voice, and video. The major methods used for data hiding are the frequency domain and the spatial domain. In the frequency domain, the secret data bits are inserted into the coefficients of the image pixel's frequency representation such as Discrete Cosine Transform (DCT) , Discrete Fourier Transform (DFT) and Discrete Wavelet Transform (DWT) . On the other hand, in the spatial domain method, the secret data bits are inserted directly into the images' pixels value decomposition. The Lest Significant Bit (LSB) is consider as the most widely spatial domain method used for data hiding. LSB embeds the secret message's bits into the least significant bit plane( Binary decomposition) of the image in a sequentially manner . The LSB is simple, but it poses some critical issues. The secret message is easily detected and attacked duo to the sequential embedding process. Moreover, embedding using a higher bit plane would degrade the image quality. In this paper, we are proposing a novel data hiding method based on Lucas number system. We use Lucas number system to decompose the images' pixels values to allow using higher bit plane for embedding without degrading the image's quality. The experimental results show that the proposed method achieves better Peak Signal to Noise Ratio ( PSNR) than the LSB method for both gray scale and color images. Moreover, the security of the hidden data is enhanced by using Pseudo Random Number Generators(PRNG) for selecting the secret data bits to be embedded and the image's pixels used for embedding.

@article{Alharbi2013,
  title     = {Novel Steganography System using Lucas Sequence},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {4},
  number    = {4},
  year      = {2013},
  publisher = {The Science and Information Organization},
  author    = {Fahd Alharbi},
  doi       = {10.14569/IJACSA.2013.040409},
  url       = {https://doi.org/10.14569/IJACSA.2013.040409}
}