International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 148 - Issue 3 |
Published: Aug 2016 |
Authors: Andysah Putera Utama Siahaan |
![]() |
Andysah Putera Utama Siahaan . High Complexity Bit-Plane Security Enchancement in BPCS Steganography. International Journal of Computer Applications. 148, 3 (Aug 2016), 17-22. DOI=10.5120/ijca2016911069
@article{ 10.5120/ijca2016911069, author = { Andysah Putera Utama Siahaan }, title = { High Complexity Bit-Plane Security Enchancement in BPCS Steganography }, journal = { International Journal of Computer Applications }, year = { 2016 }, volume = { 148 }, number = { 3 }, pages = { 17-22 }, doi = { 10.5120/ijca2016911069 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2016 %A Andysah Putera Utama Siahaan %T High Complexity Bit-Plane Security Enchancement in BPCS Steganography%T %J International Journal of Computer Applications %V 148 %N 3 %P 17-22 %R 10.5120/ijca2016911069 %I Foundation of Computer Science (FCS), NY, USA
In BPCS Steganography, data hiding will be split into blocks that have a high complexity where the blocks are categorized into informative and noise-like regions. A noise-like region is a bit-plane that has the greatest probability as a data hiding since it has a high complexity. In this region, the data inserted is vulnerable to attack. Someone can easily take a series of characters that are stored on a noise-like region previously if the system is not modified. Improving the bit-plane composition is to increase data security. Bit-plane will be combined with a specified key. The key should be changed to bit-plane form as well. The key that has already been turned into the bit-plane will be mated with the original data. Using an exclusive-or of this part is the best way to produce the cipher bit-plane. Finally, the data residing on the cover image produced have a high-security level.