A New Approach to Encryption using Huffman Coding

Priyank Chauhan, Sanjali Gupta, Nikhil Shanker Mathur

Abstract


In today’s world, where Digital Communication is becoming an integral part of everyone’s life, cyber security has become a challenge. There are various threats to the data being sent digitally.  Changing the data into an unidentifiable form can protect it from attackers. Cryptography is about constructing protocols to prevent third party interventions. Various cryptographic techniques have been proposed to make the data transfer secure. Symmetric key algorithms are the widely used for encryption. The message to be transferred should be as small as possible so as to reduce space complexity that is why compression techniques find their applications in encryption. In this paper, a new approach to encrypt text files using a mix of Huffman coding, combination of symmetric key and public key cryptography and the binary operator XOR is proposed. 


Full Text:

PDF

References


"An Introduction to Cryptography” available at ftp://ftp.pgpi.org/pub/pgp/6.5/docs/english/IntroToCrypto.pdf

Articles on “Huffman Coding”, available at http://en.wikipedia.org/wiki/Huffman_coding, http://en.wikipedia.org/wiki/Data_compression

Cryptography and Network Security, Principles and Practices by William Stallings

Security in Computing by Charles P. Pfleeger, Shari Lawrence Pfleeger.

An article on “Huffman Codes”, available at http://www.columbia.edu/~cs2035/courses/csor4231.F11 /huff.pdf

Nigam Sangwan, Text Encryption with Huffman Compression, International Journal of Computer Applications (0975 – 8887) Volume 54– No.6, September 2012




DOI: http://dx.doi.org/10.52155/ijpsat.v2.2.25

Refbacks

  • There are currently no refbacks.


Copyright (c) 2016 Priyank Chauhan, Sanjali Gupta, Nikhil Shanker Mathur

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.