Performance analysis of compression algorithms for information security: A Review

Sharma, Neha and Batra, Usha (2020) Performance analysis of compression algorithms for information security: A Review. EAI Endorsed Transactions on Scalable Information Systems, 7 (27): e2. ISSN 2032-9407

[img]
Preview
Text
eai.13-7-2018.163503.pdf - Published Version
Available under License Creative Commons Attribution No Derivatives.

Download (3MB) | Preview

Abstract

Data compression is a vital part of information security, since compressed data is much more secure and convenient to handle. Effective data compression technique creates an effective, secure, easy communicable & redundant data. There are two types of compression algorithmic techniques: - lossy and lossless. These techniques can be applied to any data format like text, audio, video or image file. The primary objective of this study was to analyse data compression techniques used for information security techniques like steganography, cryptography etc. Four each, lossy and lossless techniques are implemented and evaluated on parameters like- file size, saving percentage, time, compression ratio and speed. Detailed analysis shows that the lossy techniques performs better quantitatively whereas lossless is better qualitatively. However, lossless techniques are more effective as there is no data loss during the process. Among all, Huffman encoding outperforms other algorithms.

Item Type: Article
Uncontrolled Keywords: Data Compression, Huffman Encoding, Information Security Techniques, Lossy Techniques, and Lossless Techniques
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
QA75 Electronic computers. Computer science
Depositing User: EAI Editor II.
Date Deposited: 22 Oct 2020 12:32
Last Modified: 22 Oct 2020 12:32
URI: https://eprints.eudl.eu/id/eprint/722

Actions (login required)

View Item View Item