An efficient secure data compression technique based on chaos and adaptive Huffman coding

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.

Huffman Coding and Multi-Generation Mixing Assisted Network Coding Based MAC for QoS-Centric Secure Data Communication over MANETs

“…To retain backward compatibility with the native MANET MAC protocol standard IEEE 802.11, we propose HM2-MAC to be applied as the sub-layer of native 802.11 MAC layer. Functionally, to enhance data security and attack-resilience our proposed HM2-MAC protocol applied Huffman coding also called Prefix-coding concept [73] [74], which encodes the input data packet or vector before transmission. This approach resembles compression-based encryption to safeguard input data being transmitted.…”

“…The specific raw of the coefficient vector or matrix used for encoding is referred as encoding coefficient information (ECI). To avoid any possible pollution attack or error probability, we applied Huffman coding also called Prefix coding for data compression followed by encryption [73]. Specifically, we employed an adaptive Huffman coding algorithm as proposed in [73] [74] to perform encoding of the coefficient information.…”

“…To avoid any possible pollution attack or error probability, we applied Huffman coding also called Prefix coding for data compression followed by encryption [73]. Specifically, we employed an adaptive Huffman coding algorithm as proposed in [73] [74] to perform encoding of the coefficient information. The details of the adaptive Huffman coding algorithm can be found in [73] [74], which is not discussed in this paper due to space constraints.…”

“…Specifically, we employed an adaptive Huffman coding algorithm as proposed in [73] [74] to perform encoding of the coefficient information. The details of the adaptive Huffman coding algorithm can be found in [73] [74], which is not discussed in this paper due to space constraints. The use of proposed adaptive Huffman Huffman Coding and Multi-Generation Mixing Assisted Network Coding Based MAC for QoS-Centric Secure Data Communication over MANETs ________________________________________________________________________________________________________________ coding concept not only reduced additional computational overheads caused due to iterative encryption, but also enhanced buffer utilization to meet QoS demands in MANET.…”

“…In HM2-MAC protocol, receiving packet data units from the upper system layers such as Application Layer, the source node executes Huffman coding or prefix coding as per [73], which eventually generated MAC EPDU, also called the source packets, ( 1 , 2 , … … ). Here, each source packet represents a 1 × vector from a Galois Field 2 , where we maintained size of the Galois Field as 8.…”