Pixel and Block Permutation on Combinations of Bit Planes with LSB Steganography

Rodrigues, Marline Priyanka and Prabhu, Srikanth (2018) Pixel and Block Permutation on Combinations of Bit Planes with LSB Steganography. In: ICCSITSS, 21/12/2018, RVCE BENGALURU.

[img] PDF
1291.pdf - Published Version
Restricted to Registered users only

Download (856kB) | Request a copy

Abstract

Protecting confidential information from getting into the hands of intruders has been a matter of concern since ancient times. With the increasing advances in technology and computing resources, researchers have been proposing techniques with varied objectives to serve the current requirements of data communication. Also, advances in security techniques also face the threat of advances in attacks by intruders. While encrypting the data before transfer was enough to provide security, intruders were capable of breaking the code and hence multiple layers of security became the need of the hour. This paper proposes dual permutation of image applied on a group of four of the bit planes. First, using Rubik’s cube principle for pixel permutation and second using block permutation. Thus, the correlation between pixels and blocks is reduced significantly in the encrypted image which is evident from the correlation coefficient. Encryption followed by Steganography using LSB substitution provides the third layer of security at the bit level.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Encryption; steganography;
Subjects: Engineering > MIT Manipal > Computer Science and Engineering
Depositing User: MIT Library
Date Deposited: 15 Jan 2019 08:45
Last Modified: 15 Jan 2019 08:45
URI: http://eprints.manipal.edu/id/eprint/152902

Actions (login required)

View Item View Item