Performance analysis of compression algorithms for information security: A Review

Abstract

Data compression is a vital part of information security, since compressed data is much more secure and convenient tohandle. Effective data compression technique creates an effective, secure, easy communicable & redundant data. There aretwo types of compression algorithmic techniques: - lossy and lossless. These techniques can be applied to any data formatlike text, audio, video or image file. The primary objective of this study was to analyse data compression techniques usedfor information security techniques like steganography, cryptography etc. Four each, lossy and lossless techniques areimplemented and evaluated on parameters like- file size, saving percentage, time, compression ratio and speed. Detailedanalysis 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 outperformsother algorithms.

Keywords

• data compression
• huffman encoding
• information security techniques
• lossy techniques
• and lossless techniques