HIGHLY SECURED ENCRYPTION ALGORITHM
USING LOGICAL OPERATION AND COMPRESSION
Guided by:
Presented by:
Abstract
The process of exchanging information is called
communication. The basic communication system
involves transmitter, receiver and the channel. The
data transmitted by the sender reaches receiver
through the channel. The unauthorized parties
(cracker, hacker, eavesdropper, or attacker) should
not be able to access the information at the channel.
Therefore transmitting data securely from the
sender to the receiver is a very important aspect.
In this work we have devised a new
cryptographic primitive that concentrates on
efficient encryption scheme by involving
arithmetic and logical operations, decryption of
plaintext string of any Unicode support
language. To make the security stronger we
enhanced by introducing the data compression
techniques .
Existing system
Unicode supported language with string plain text(size) has
been implemented with simple encryption and decryption
method.
ENCRYPTION:
The plain text character is converted into equivalent
Unicode value, then 9s complement of it was taken generate
the public key generated and XORed with the Unicode value
and then converted to binary value. The binary value is
converted into Unicode hexadecimal after bit shuffling.
DECRYPTION:
Input the Encrypted Data(ciphered text) The
inverse process of encryption on encrypted
data resulting Unicode value and the retrieval
back to the plain text.
PROBLEM
Highly secured data Transfer with Encryption &
Compression Techniques
while sending and
Decryption & Decompression techniques while
receiving the data.
Proposed system
Instead of single complement we are implementing
2s complement to increase the security.
We proposed 10s and 2s complement.
Along with encryption we introduce data compression
technique before converting to Hexa Unicode
converting.
ARCHITECTURE DIAGRAM
Sender site
Receiver site
INPUT
OUTPUT
Plain
text
ENCRYPTION
DECOMPRESSION
COMPRESSION
unicode
10s
complemen
t
Pseudo
key
Logical
operation
2s
complemen
t
Bit
shuffling
compressio
n
Ciphered
text
Decompres
s/cipher
text
Algorithm of proposed system
Encryption Algorithm:
Step1 : Input the plaintext
Step2 : Convert the plaintext in to Unicode values.
Step3 : Take the 10s complement .
Step4 : Generate public key values .
Step5 : Logical operation(XOR) with value from step 2
and value from step 4.
Step6 : Take the 2s complement for each value obtained in
step 5.
Step7 : Convert to binary value for bit shuffling.
Step8 : Compression of value from step 7.
Step9 : Generating to final output cipher-text.
Decryption Algorithm:
Step 1: Start
Step 2: Input the Cipher-text and Encrypted key seed
value.
Step 3:Decompress the Cipher-text input value.
Step 4: Decrypt the key seed value and generate the key
values using key generation algorithm.
Step 5: Apply the Encryption Algorithm in reverse
direction.
Step 6:Retrieve the plaintext message.
WORKING MODEL
Plain text:
In this module the plaint text from sender site is used
as input for the next module.
Unicode :
In this module the input plain text is converted into
unicode value .
10s complement:
In this module the unicode value is translated with
10s complement for making security at first level.
Pseudo key generation:
In this module pseudo key generated by providing proper
side value using random number.
Logical operation:
In this module the Unicode value is XORed with Pseudo key
value which makes the data as secured encrypted data.
2s complement:
In this module the value from logical operation is taken for
the next level of security by taking its 2s complement.
Bit shuffling:
After taking the complement , this value is converted into
binary value and then proceeded for bit shuffling.
Compression:
To provide the higher level of security the value after
bit shuffling is compressed.
Output:
The final output is given in Cipher-text .
Decryption:
Input the ciphered text and apply the above modules
in
reverse direction.
The resulting value is retrieved as plain text.
Chart
Compression Efficiency:
Compression Efficiency
Original File Size
TIME TAKEN
6463
3750
3453
2031
0
1
0
2
0
3
780
0
4
0
5
Compress Time Taken:
7000
6000
5000
4000
Original File Size
TIME TAKEN
3000
2000
1000
0
Conclusion
To communicate or share, the file or data between the Sender
and Receiver through the channel with security, we have
introduced Compression and Decompression of the data or file
after Encryption and Decryption. This provides double security
to the data or file from unauthorized parties (cracker, hacker,
eavesdropper, or attacker ).In addition to provide high security
we have used two logical operations and bit shuffling in our
algorithm ,so this algorithm performs efficiently than other
existing algorithms. Since we have evaluated with small size of
data and we have not considered the processing time, this can be
further evaluated with large size of data. Further the
performance can be improved with space and time complexity.
Result
Original file
Encrypted file
Decrypted file
Original file size: (2,031 kb)
Compress file size:(1,350 kb)
Decompress file size(2,031 kb)
Thank you
