Abstract
Data stored in physical storage or transferred over a communication channel includes substantial redundancy. Compression techniques cut down the data redundancy to reduce space and communication time. Nevertheless, compression techniques lack proper security measures, e.g., secret key control, leaving the data susceptible to attack. Data encryption is therefore needed to achieve data security in keeping the data unreadable and unaltered through a secret key. This work concentrates on the problems of data compression and encryption collectively without negatively affecting each other. Towards this end, an efficient, secure data compression technique is introduced, which provides cryptographic capabilities for use in combination with an adaptive Huffman coding, pseudorandom keystream generator, and S-Box to achieve confusion and diffusion properties of cryptography into the compression process and overcome the performance issues. Thus, compression is carried out according to a secret key such that the output will be both encrypted and compressed in a single step. The proposed work demonstrated a congruent fit for real-time implementation, providing robust encryption quality and acceptable compression capability. Experiment results are provided to show that the proposed technique is efficient and produces similar space-saving (%) to standard techniques. Security analysis discloses that the proposed technique is susceptible to the secret key and plaintext. Moreover, the ciphertexts produced by the proposed technique successfully passed all NIST tests, which confirm that the 99% confidence level on the randomness of the ciphertext.
Highlights
The aim of securing data during storage or transmission is to increase the resistance level against various security attacks and protect the data from accidental modifications, illegal or unauthorized access [1]
This work focuses on the problems of data compression and encryption collectively so that compression is carried out according to a secret key such that the output will be both encrypted and compressed in a single step
These results showed that both well-known compression techniques Arithmetic Coding (AC) and Adaptive Huffman Coding (AHC) were the fastest while performing only data compression without any encryption capabilities
Summary
The aim of securing data during storage or transmission is to increase the resistance level against various security attacks and protect the data from accidental modifications, illegal or unauthorized access [1]. All compression systems are grounded on the same principle, that is, compact input data by eliminating redundancy Both data compression and encryption are essential, but their implementation is difficult and complicated, which requires extensive computation power and resources to process a large amount of data. This work focuses on the problems of data compression and encryption collectively so that compression is carried out according to a secret key such that the output will be both encrypted and compressed in a single step Towards this end, this work proposes an efficient, secure data compression technique by introducing cryptographic capabilities in adaptive Huffman coding using chaotic pseudorandom keystream generator and chaotic S-Box. The proposed technique intends to achieve confusion and diffusion properties of cryptography into the compression process of adaptive Huffman coding and overcome the performance issues of the prior techniques.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have