High Complexity Bit-Plane Security Enchancement in BPCS Steganography

  • Putera A
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Putera, A. (2016). High Complexity Bit-Plane Security Enchancement in BPCS Steganography. International Journal of Computer Applications, 148(3), 17–22. https://doi.org/10.5120/ijca2016911069

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free