IMPROVISED SECURITY AND COMPRESSION ALGORITHM ON HUFFMAN ENCODING
DOI:
https://doi.org/10.61841/t61hp766Keywords:
Data Encryption and Compression,, Redundancy, Storage Overhead Reduction,, de-duplication,, , optimal prefix code.Abstract
Huffman Encoding is an absolute algorithm of data encryption and size compression that converts streams of multi-typed data into streams of binary data and enhances the pattern occurrences in the same. The yield of huffman encoding calculation is a specific kind of ideal prefix code, generally referred as lossless data compression. A combination of two previously defined but now obsolete algorithms of data compression that, when combined and executed over test cases of textual data can compress at massive ratios. The procedure also involves a minimal amount of system resources such as memory and RAM. This feature makes the procedure immensely efficient and beneficial to cases of data transmission where the system resources available are less and/or the bandwidth of the channel is insufficient. The method of de-duplication works efficiently on data with larger inherent or generated patterns. Hence, the output of Huffman Encoding will work as an appropriate input for the de duplication module. Data de-duplication, which can also be referred as an efficient compression is a process that can be used to eliminate redundant patterns present in data thus decreasing the storage overhead. It makes sure that only one unique illustration of a pattern is maintained on the source of storage. Repeated data blocks in files are substituted with a referential pointer that points to its unique copy of data pattern.
Keywords--
Downloads
References
1. Nidhi Dhawale, Implementation of Huffman algorithm and study for optimization, 2014 International Conference on Advances in Communication and Computing Technologies (ICACACT 2014)
2. G.Soma Sekhar1 and E.Sreenivasa Reddy, An Enhanced Data Security with Compression for MANETs, International Journal of Computer Networks and Communications Security, VOL. 2, NO. 12, December 2014, 456–461.
3. T.SubhamastanRao, M.Soujanya, T.Hemalatha, T.Revathi, Simultaneous data compression and encryption, International Journal of Computer Science andInformation Technologies, Volume2(5),2011.
4. AL.Jeeva, V.Palanisamy, K.Kanagaram, Comparative Analysis of Performance Efficiency and Security Measures of Some Encryption Algorithms, International Journal of Engineering Research and Applications, Volume 3,Issue 6, June 2013
5. Mamta Sharma S.L. Bawa, Compression Using Huffman Coding, International Journal of Computer Science and Network Security, VOL.10 No.5, May 2010.
6. Harshraj N. Shinde, Aniruddha S. Raut, Shubham.Vidhale, Rohit V. Sawant, Vijay A. Kotkar, A Review of Various Encryption Techniques, International Journal of Engineering and Computer Science, Volume 3, Issue 9, 2014.
7. http://www.snia.org/sites/default/files/Understanding_Data_Deduplication_Ratios-20080718.pdf
8. http://www.3gendata.com/whitepaper/3gen_datad edup_white_paper_new.pdf
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
