CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

High Complexity Bit-Plane Security Enchancement in BPCS Steganography

by Andysah Putera Utama Siahaan
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 148 - Number 3
Year of Publication: 2016
Authors: Andysah Putera Utama Siahaan
10.5120/ijca2016911069

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 },
issue_date = { Aug 2016 },
volume = { 148 },
number = { 3 },
month = { Aug },
year = { 2016 },
issn = { 0975-8887 },
pages = { 17-22 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume148/number3/25737-2016911069/ },
doi = { 10.5120/ijca2016911069 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:52:19.677607+05:30
%A Andysah Putera Utama Siahaan
%T High Complexity Bit-Plane Security Enchancement in BPCS Steganography
%J International Journal of Computer Applications
%@ 0975-8887
%V 148
%N 3
%P 17-22
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. N. Johnson dan S. Jajodia, “Exploring Steganography: Seeing The Unseen,” IEEE Computer, pp. 26-34, 1998.
  2. Y. K. S. P. S. M. M. B. Prashant Lahane, “Visual Cryptography and BPCS Steganography for Data Shielding,” International Journal Of Engineering And Computer Science, vol. 4, no. 5, pp. 11997-11999, 2015.
  3. P. R. Rudramath dan M. R. Madki, “High Capacity Data Embedding Technique Using Improved BPCS Steganography,” International Journal of Scientific and Research Publications, vol. 2, no. 7, pp. 1-4, 2012.
  4. E. Kawaguchi dan R. O. Eason, “Principle and applications of BPCS-Steganography,” SPIE.
  5. S. Mehta, K. Dighe, M. Jagtap dan A. Ekre, “Web Based BPCS Steganography,” International Journal of Computer Technology and Electronics Engineering, vol. 2, no. 2, pp. 126-130, 2015.
  6. P. P. Khairnar dan P. V. S. Ubale, “Steganography Using BPCS technology,” International Journal of Engineering and Science, vol. 3, no. 2, pp. 8-16, 2013.
  7. C. Jain, VivekParate, A. Dhamanikar dan R. Badgujar, “Review on Steganography and BPCS Technology in Steganography for Increasing Data Embedding Capacity,” International Journal of Innovative Research in Computer and Communication Engineering, vol. 3, no. 1, pp. 60-65, 2015.
  8. N. F. Johnson dan S. Jajodia, “Steganography: Seeing the Unseen,” IEEE Computer, pp. 26-34, 1998.
  9. B. A. Forouzan, Cryptography & Network Security, New Delhi: McGraw Hill Publication, 2008.
  10. A.-M. A., Steganography-Based Secret And Reliable Communications Improving Steganographic Capacity And Imperceptibility, School of Information Systems, Computing and Mathematics, 2010.
  11. V. J. Patel dan N. RipalSoni, “Uncompressed Image Steganography using BPCS: Survey and Analysis,” OSR Journal of Computer Engineering, vol. 15, no. 4, pp. 57-64, 2013.
  12. H. Noda, M. Niimi dan EijiKawguchi, “A Steganography Based on Region Segmentation by Using Complexity Measure,” Trans. of IEICE, vol. 81, no. 2, pp. 1132-1140, 1998.
  13. P. R. Rudramath dan M. R. Madki, “Improved BPCS Steganography Based Novel Approach for Data Embedding,” International Journal of Engineering and Innovative Technology, vol. 1, no. 3, pp. 156-159, 2012.
  14. V. J. Deshmukh dan D. A. S. Alvi, “BPCS Steganography and Visual Cryptography: An Advance Technique for Online Payment Security in E-Commerce for Developing Countries,” International Journal of Science and Research, vol. 4, no. 3, pp. 294-297, 2013.
  15. S. S. Solanke dan P. D. C. Dhanwani, “Survey on Modified BPCS Steganography Based on Sequence of Cipher Bits,” International Journal of Engineering Development and Research, vol. 3, no. 2, pp. 1036-1040, 2015.
  16. A.P. U. Siahaan, “RC4 Technique in Visual Cryptography RGB Image Encryption,” SSRG International Journal of Computer Science and Engineering (SSRG-IJCSE), vol. 3, no. 7, pp. 1-6, 2016.
Index Terms

Computer Science
Information Sciences

Keywords

Bit-Plane High Complexity Segmentation

Powered by PhDFocusTM