Title :
|
A study on time complexity of least significant bit steganography
|
Author :
|
Surbhi Singhania, Shailender Gupta, Bharat Bhushan
|
Conference :
|
National Conference on Science in Media SIM 2012 (December 3-4, 2012) Organized by YMCA University, Faridabad (India)
|
Keywords :
|
Confidentiality, LSB, Time Complexity
|
Abstract :
|
Steganography is the art of concealing private or
sensitive information within a carrier for all intents and
purposes, appears innocuous. It increases the level of privacy and
security by making the confidential communication invisible. The
most popular technique used is Least Significant Bit (LSB)
substitution steganography. In this method, the least significant
bits of pixels of cover image are replaced by secret data bits. This
paper is an effort to find the impact of varying the number of
least significant substitution bits of pixels by designing a
simulator in MATLAB-11. The results show that as the number
of LSB bits embedded is increased, the time complexity and
capacity to embed secret data increases
|
Download Paper :
|
|