integrating hash least significant bit (h-lsb) and k means...

Integrating Hash Least Significant Bit (H-LSB) and K – Means

Clustering for Security Enhancement in Image Encryption

Praseeja V S

Research Scholar, Department of Computer Science, Sree Narayana Guru College,

Coimbatore - 641 105.

VR. Nagarajan, PGDCS., MCA., M.Phil.,

Assistant Professor, Department of Computer Application and Information Technology,

Sree Narayana Guru College, Coimbatore - 641 105.

Abstract

Nowadays, the community has important roles for transferring records precisely and quick from

source to a destination. The statistics is no longer invulnerable sufficient to switch noticeably

confidential. The protection of statistics has to turn out to be one of the principal challenges of

aid sharing with facts communication over a pc network. The methods are Steganography as well

as cryptography for defending facts from intruders while transferring over public network. The

data encipherment is performed by Cryptography and secret message hiding is executed by

steganography in a cowl image. Encryption is considered to be the safety technique extensively

used to make certain secrecy. Encryption is an absolutely mathematical procedure which

includes the information as an input where the information is processed by various operations

and the results are generated. Blowfish is the superlative encryption algorithms because it

requires much less execution time, memory and has high throughput. However, if any

eavesdropper detects the presence of encrypted information he or she can attempts a few attacks

to obtain the unique data. So there is a want to provide a two-layer strategy for higher security. In

this work, a Hash Least Significant Bit (H-LSB) combined with the method of encipherment is

projected for affording greater protection to statistics in a community environment. It provides

the most throughput (faster) and additionally electricity efficient. The image security can be

more improvised by encryption. A K-means cluster-based totally steganographic technique will

be used. The images like real and face image are examined and hence the actual picture gets

Compliance Engineering Journal

Volume 10, Issue 9, 2019

ISSN NO: 0898-3577

Page No: 437

entrenched in the face image regions, the place coloration schemes of the actual as well as face

becomes more relevant.

Keywords: Image Encryption, Cryptography, Embedding, Steganography, Clustering

1. Introduction

Under this research, invulnerable mechanism is proposed to impenetrable the images in the inter-

space communications. Hence the digital data can be copied without any loss in the content.

Steganography is not as sturdy to assaults on the grounds that the embedded information is

vulnerable to destruction. The insignificant bits are either unused or replaced with the secret

information in this method. Nowadays, to encipher and decipher records in order to guard the

message secret and hence many distinct techniques have been developed. The method

“cryptography” consists of a change of a message for protecting the secrecy conversation and it

is shown in figure 1. The upward shove of the internet, the most necessary elements of statistics

science and communication has been the protection of data. The covert messages are hidden in

unsuspected multimedia records and are normally used in secret medium between stated parties.

The international locations don‟t prefer the facts to get leaked. The simple need for every

developing location in today‟s world is communication [4].

Figure No: 1 Process of Cryptography

Data protection and confidentiality is required when the information is conveyed over the

untrusted channels. To overcome these limitations, a powerful and secured device is proposed

based totally on the integration of cryptography and steganography. This combined crypto-

stegano method that utilizes the facts to cover the secret message and data can be transformed in

the perfect manner and the method is depicted in figure 2. Hence there is a protection mechanism

which can ensure the safety of inter-space transmissions.



ISSN NO: 0898-3577

Page No: 438

Figure No: 2 Steganographic Framework

The protection mechanisms are dealt with the secret key and the owner of the private key will be

employed for deciphering the cipher text to original text. The system of lowering the size of an

information file is popularly referred to as statistics compression; though its formal name is

supply coding (coding completed at the source of the records earlier than it is saved or

transmitted). In the daily existence many insecure pathways are used for broadcasting the data

over telephone or internet. Security equipment such as crypto-stegano are utilized to reap such

objectives, however, both have boundaries and prone to assaults if they have been used

individually. Hybrid image graph protection offers an elucidation to the difficulties. However, at

a certain stage, it‟s not safe. An extended analysis will demonstrate the efficiency of the

projected model by means of measuring Mean-Square-Error (MSE), image histogram and Peak-

Signal-to-noise-Ratio (PSNR) [6].

Encrypted messages can once in a while be damaged by using cryptanalysis, also called code-

breaking, even though the cryptography strategies are certainly unbreakable. No statistics is

misplaced in lossless compression. The problem arises for the protection of property rights who

own that data. In information technology, information compression, supply coding, or bit-rate

minimization involves utilizing the smaller number of bits for encoding than the unique

representation. This is required when exclusive a kind of digital image is broadcasted via the

networks. Everyone needs to defend the data of work to be secret and safe. Steganography is an

encryption method where the data can be hided amongst the cover file of the bits, such as an

image or an audio file. Digital multimedia is data can be delivered over the computer networks,

which is prone to the security breaches. It includes a mixture of steganography, cryptography,

and compression. The secret message is encrypted with blowfish cipher and visual cryptography.

Finally, the encrypted records are embedded into two harmless cover pics for future



ISSN NO: 0898-3577

Page No: 439

transmission. The facts can be protected or remodeled into a different format which is said to be

ciphertext.

2. Related Work

Younes et al [5] created a method to disguise information in the encrypted picture then send the

encrypted image to the receiver over the network. Here the filtering and segmenting of the image

is performed and hence the substitute bits are employed on the important pixels. Gary C.Kessler

gave an steganography overview for the computer forensics [4]. The method is the finest record

source and numerous encryption algorithms and the structure are examined. The source is proved

to be the major supply for encryption algorithm studies. On the different hand, El-Emam [6] to

cover a giant quantity of information with excessive security, he proposed a steganography

algorithm. This technique that has used and authors can forestall the unauthorized to get

admission to the facts internal the image. These pixels have chosen randomly alternatively than

sequentially.

Chanu Y. J, have given a approach based on Image Steganography and Steganalysis [2]. From

this work, it is effortless to understand and evaluate the steganography techniques. In this work,

the author has carried out a special survey on a number of steganography techniques. This work

is the main source behind steganography. Next method is developed by Chamkour Singh et al [3]

based on cluster-based Image Steganography the use of Pattern Matching”. This method is extra

impenetrable than all different image steganography strategies because it makes it challenging to

observe the hidden image in the protecting image. A steganography approach is developed in

which color primarily based evaluation on the image graph to cover the picture information

efficaciously into some other image by using the use of a color clustering technique.

A primary method of image encryption is on a new hyper chaotic finance system. The generation

of chaotic and key sequence by the use of the Runge–Kutta method and the chaotic sequence

approach. In this work, a hyper chaotic finance system is projected which is dependent on

chaotic finance system. The image encryption in relation to plaintext is performed by key

sequence [1].

Ibrahim et al. [7] proposed a method to conceal information of internal image by means of the

use of steganography technique. The approach consisting of binary codes and pixels of an image



ISSN NO: 0898-3577

Page No: 440

are executed. The previously used zipped file is transformed to binary codes to enhance the

records storage in the image. Roza [8] proposed a new technique to improve courier provider

online device by the usage of crypto-stegano methods. The writer used these strategies to encrypt

element statistics about the items, ATM card, series and destination address. In addition, the

administrator on the machine can decrypt without problems the detail information. Dasgupta et

al. [9] proposed an approach for video steganography by way of using a hash-based least great

bit. In LSB, the bits can be inserted by employing the hash feature and hence the data privacy

happens in the LSB and can be performed by entrenching the secret information of the cover

frames.

3. Existing System

3.1 Blowfish Encryption

The cryptographs depicts the simple concept that is: at the sender side, where the plaintext gets

transformed into cipher textual content by the use of encryption algorithms, Cipher textual

content is conveyed over the communicating channel and subsequently at the destination part the

cipher textual content is transformed to the authentic plain textual content by using the use of

decryption algorithm. It utilizes highly straightforward operations like growth and XOR

expansion. Blowfish is a Feistel community with 16 iterations and it is recorded in figure 3.

Before the stage of encryption, there is a problematic introduction stage required and the true

data encipherment is extremely fantastic on big microchips [12].

Figure No: 3 Blowfish Algorithm



ISSN NO: 0898-3577

Page No: 441

Blowfish was once designed in 1993 and created by Bruce Schneier as open and speedy method

to existing encryption algorithms. It is rapid as this algorithm rate on a 32-bit microchip is 26

clock cycles for every byte. In cryptography, plain text is modified into a non-readable message

by various operations. Symmetric algorithms are Data Encryption Standard (DES), Advanced

Encryption Standard (AES), Blowfish Encryption Algorithm, International Data Encryption

Algorithm, and Triple Data Encryption Standard, etc. Symmetric key encryption uses equal key

to encipher and decipher the records whilst in uneven key encryption two keys are used; non-

public keys and public keys.

Out of these algorithms, the algorithm is used in this device called as blowfish because it is the

superlative encryption algorithms which requires less execution time, memory and has high

throughput. The symmetric encryption algorithms are faster comparatively. This is because of

the necessity of processing power of computers. Different types of secured algorithms are

considerably available and are classified into asymmetric and symmetric methods of encryption.

The block cipher is successfully used for encryption and information protection. The exquisite

components of the Blowfish algorithm with stunning facets and helps the works are as per the

following: Two operations are forming the blowfish algorithm; key expansion and records

encryption. The encryption is executed by public key and the non-public key is used for

decryption. The popular block dimension is sixty-four bits; the place in the key can fluctuate up

to 448 bits. In shape, it looks like CAST-128, which utilizes settled S-boxes. It includes a 64-bit

block size. Cryptography is the artwork and science of accomplishing security by using encoding

message to make them non-readable form. Though it suffers from vulnerable keys problem, no

attack is recognized to be successful in opposition to it. It is minimized as it can be achieved

beneath 5kb memory. The variable-length key is taken from 32 bits to 448 bits which is perfect

for securing data. It controls data in widespread pieces. It has an adaptable key, from 32 bits to

256bits. It makes use of large key-subordinate S-boxes. This encourages examination and

expansion of the belief in the calculation. Key growth converts user‟s key into numerous sub-

keys P-array and S-Boxes which will be used later in encryption and decryption.

Still, the accuracy time can be more advantageous and the encryption time can be reduced by

way of combining Hash Least Significant Bit (H-LSB) and K – Means clustering algorithm.



ISSN NO: 0898-3577

Page No: 442

4. Proposed System

4.1 Hash Least Significant Bit (H-LSB)

LSB is the most popular steganography method to embedding records in a image file. It consists

of distribution sample and the 2 bits are chosen and they get hided in blue pixel. Affine cipher is

utilized to encrypt data. In this method each letter in an alphabet is associated to its

corresponding number, encrypted the usage of a mathematical function, and transformed

returned to a letter. This technique has utilized to hide the encrypt message in the image and then

send the picture to the intended receiver. Thus, the image quality will be now not sacrificed. This

method is done with the aid of the use of Hash-based Least Significant Bit (HLSB) which

replaces the least big bit. This proposed method is used to prevent the intruders to get the actual

records when they attempt to retrieve the data [10].

Figure No: 4 Encryption Phase

The vital goal of the system is to cover the message or a secret message into an image before

transmitting to the destination node on the network except any amendment of the statistics inner



ISSN NO: 0898-3577

Page No: 443

an image. At the first step to getting entry into the system for hiding the data, the users are

needed a consumer title and password. The technique is projected and the approach is to

embedding once the encryption is done into the image. According to the methods that have

employed to entrench the secret information into the three bits of the image and they are

entrenched in Red pixel LSB, three bits are entrenched in Green pixels and 2 bits are entrenched

in blue pixels LSB. The proposed strategies statistics steganography using Hash-based Least

Significant Bit (H-LSB) is used to cover secret message in the picture file (BMP). In this

machine, the proposed scheme makes use of affine algorithm to encrypt secret information. This

encrypts statistics will be embedded inside the picture with almost zero distortion of the original

image. After login the system, the user can write the message to encrypt the records with the

secret keys before embedding the information into a image as shown in figure 4.

After converting the undeniable text into ciphertext with the aid of using Affine algorithm the

cipher textual content is taken and changing each letter into ASCII codes then the ASCII codes

have transformed into a series of binary codes to provide greater security. In this work crypto-

stegano techniques have been proposed to furnish higher security to shield records from intruders

with the aid of using multi-layer of security techniques. This method presents higher protection

to shield the data consumer from the unauthorized get entry to over a community due to which

will no longer be easy to retrieve the data without the recipient key. In this work, new protection

methods are proposed through the usage of cryptography and steganography for presenting

higher protection to keep the privacy, accuracy, and confidentiality of the records while

transferring from one node to other over the network. This method is continued until the whole

message of bits will get embedded into the cowl image. At the start of this process we take

encrypt message to be embedded in the cover image, which will be hard for any intruder to

decrypt it by non-public key of the receiver and then the positions are chosen by the hash

function. The proposed technique acquires eight bits of secret records at a time and it gets

entrenched in LSB of RGB (Red, Green and Blue) pixel cost in the order of 3, 3, 2 respectively.

The insertion of eight bits and it will have an effect on of blue coloration is more for human eye

than crimson and green colors. (1)

The aggregate of these two methods will beautify the safety of statistics embedding due to some

vital information that users choose to impervious from others when statistics are broadcasted



ISSN NO: 0898-3577

Page No: 444

over a channel. To become aware of the positions to cover information in LSB of every RGB

pixels of the cowl image the following system is used:

K= p % n ……… (1)

Where K is the LSB bit role inside the pixel, P represents the function of every hidden picture

pixels and n is the number of bits of LSB.

4.2 K – Means Clustering

The algorithm is initiated with the aid of the estimation of k centroids randomly generated from

the information set. Every statistics factor are associated with the nearest imply to obtain ok

clusters. In general, n data points xi, i=1…n are considered, the place n refers to the most number

of pixels in an image that has to be partitioned in clusters. The huge improvement in science

facilitating the switch of facts via the internet has a lot of security threats as these public domains

are exceedingly vulnerable. The method is performed continuously until the centroids received

are as equal as those of preceding iteration. The clusters of every centroid are obtained is

assigned as the new mean. This work suggests the development in the discipline of video

steganography, its uses and methods based on secret media, image, and video [11]. The rapid

boom in digitalization and utilization of public area channels has appreciably facilitated the

transfer of data. The work additionally makes a performance evaluation of recognized picture

steganography methods and identifies K-means clustering as one of the most appropriate

strategies for image steganography, which is utilized in fixing most of the actual time problems.

K-means clustering is an unsupervised learning method of data mining used for unlabelled data.

The intention is to assign a cluster to each statistics point. Among the methods used for

concealing the private data, imagegraph steganography is eminent. By the usage of K-means the

positions μi, i=1...k of the clusters are discovered and that limit the distance from the facts points

to the cluster. K-means clustering solves

---------- (2)



ISSN NO: 0898-3577

Page No: 445

Where, ci is the set of points that belongs to cluster i. The K-means clustering uses the square of

the Euclidean distance is

------------ (3)

The approach is simple, easy to put in force and to interpret the clustering result. Quality of the

image is retained. It is a quick and efficient strategy in terms of computational cost. When

utilized to imagegraph steganography, it is imperceptible for that reason making it much less

inclined to steganalysis.

5. Results and Discussion

An extended analysis used to be made to show the efficiency of the proposed mannequin via

measuring Mean-Square-Error (MSE), Peak-Signal-to-noise-Ratio (PSNR), and image

histogram. The robustness was once examined with the aid of launching statistical and visual

attacks.

Table No: 1 Performance Measures

Figure No: 5 Performance Measures

0

20

40

60

PSNR MSE

Alg

ori

thm

Performance Measures

Performance Measures

Blowfish

HLSB + K - Means

Image

Blowfish HLSB + K - Means

PSNR MSE PSNR MSE

49.56

0.412

31.25

1.850



ISSN NO: 0898-3577

Page No: 446

The performance measures like PSNR and MSE values are analyzed and the proposed work

gives the better performance than the existing system and it is shown in table 1 and figure 5. In

the same way, the throughput parameter also gives the better performance than existing system

and the results are given in table 2 and figure 6.

Image (Bytes) Methods Throughput

256 Blowfish 92.3

HLSB + K - Means 97.4

Table No: 2 Throughput

Figure No: 6 Throughput

Data security and confidentiality is required when the information over illegal networks take

place. The proposed model offers an invulnerable suggests transmitting or saving noticeably

categorized information for the public security sector.

6. Conclusion

Data protection and confidentiality is required when information over illegal networks take

place. Hence the method for data encipherment is performed by cryptography and the secret data

covering is performed by steganography. The data secrecy can be more improvized by executing

the encryption concept. The method called “Hash Least Significant Bit (H-LSB)” with affine

89

90

91

92

93

94

95

96

97

98

Blowfish HLSB + K - Means

Me

tho

ds

Throughput

Methods



ISSN NO: 0898-3577

Page No: 447

cipher has been projected for affording more protection to data in the environment. A K-means

cluster-based totally steganographic technique will be used. Real picture and face image would

be analyzed, and the actual picture would be embedded.

7. References

[1] Tong, Xiao-Jun, et al. "An image encryption scheme based on a new hyperchaotic finance

system." Optik-International Journal for Light and Electron Optics 126.20 (2015): 2445-2452.

[2] Chanu Y. J, “A short survey on image steganography and steganalysis techniques”,

NCETAS, vol. 1, pp. 52-55, IEEE, 2012.

[3] Chamkour Singh, Gauravdeep, “Cluster based Image Steganography using Pattern

Matching”, IJAIR, vol. 2, issue 5, 2013

[4] Gary C.Kessler, “An overview of steganography for the computer forensics examinier”, vol.

6, no. 3, Forensic science communications, 2011

[5] Mohammad Ali Bani Younes and Aman Jantan” A New Steganography Approach for Image

Encryption Exchange by Using the Least Significant Bit Insertion” IJCSNS International Journal

of Computer Science and Network Security, VOL.8 No.6, June (2008):247-254.

[6] Nameer N. EL-Emam.” Embedding a Large Amount of Information Using High Secure

Neural Based Steganography Algorithm”. International Journal of Computer, Electrical,

Automation, Control and Information Engineering. Vol:2, No:11, (2008):3806- 3817.

[7] Rosziati Ibrahim and Teoh Suk Kuan.” Steganography Algorithm to Hide Secret Message

inside an Image”. Computer Technology and Application, Vol. 2 (2011): 102-108.

[8] Roza Hikmat Hama Aziz.”Improving Courier Service Reservation System: Reliability and

Performance”, Asia Journal of Natural & Applied Sceinces, Vol. 4 (4), December (2015): 20-36

[9] Kousik Dasgupta , J.K. Mandal and Paramartha Dutta.” Hash Based Least Significant Bit

Technique For Video Steganography(HLSB)”, International Journal of Security, Privacy and

Trust Management (IJSPTM), Vol. 1, No 2, April (2012):1-11.



ISSN NO: 0898-3577

Page No: 448

[10] Rashid, Aqsa, Malik Missen, and Nadeem Salamat. "Analysis Of Steganography

Techniques Using Least Significant Bit In Grayscale Images And Its Extension To Colour

Images" Journal of Scientific Research & Reports (JSRR) 9.3 (2016): 1-14.

[11] P. K. Sethy, K. Pradhan, and S. K. Behera, „A security enhanced approach for video

Steganography using K-Means clustering and direct mapping‟, Int. Conf. Autom. Control Dyn.

Optim. Tech. ICACDOT 2016, pp. 618–622, 2017.

[12] B. Schneier, “Description of a new variable-length key, 64-bit block cipher (blowfish) fast

software encryption”, Cambridge security workshop proceedings (December 1993),

springerverlag, 1994, pp. 191-204.



ISSN NO: 0898-3577

Page No: 449

integrating hash least significant bit (h-lsb) and k means...

Documents