Openly accessible

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

Usama, Muhammad, Malluhi, Qutaibah M, Zakaria, Nordin, Razzak, Muhammad Imran and Iqbal, Waheed 2020, An efficient secure data compression technique based on chaos and adaptive Huffman coding, Peer-to-peer networking and applications, pp. 1-14, doi: 10.1007/s12083-020-00981-8.

Attached Files
Name Description MIMEType Size Downloads

Title An efficient secure data compression technique based on chaos and adaptive Huffman coding
Author(s) Usama, Muhammad
Malluhi, Qutaibah M
Zakaria, Nordin
Razzak, Muhammad ImranORCID iD for Razzak, Muhammad Imran orcid.org/0000-0002-3930-6600
Iqbal, Waheed
Journal name Peer-to-peer networking and applications
Start page 1
End page 14
Total pages 14
Publisher Springer
Place of publication Cham, Switzerland
Publication date 2020-10-19
ISSN 1936-6442
1936-6450
Keyword(s) Security
Secure compression
Encryption
Chaotic map
Summary 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.
Language eng
DOI 10.1007/s12083-020-00981-8
Indigenous content off
HERDC Research category C1 Refereed article in a scholarly journal
Free to Read? Yes
Persistent URL http://hdl.handle.net/10536/DRO/DU:30147627

Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 1 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 40 Abstract Views, 2 File Downloads  -  Detailed Statistics
Created: Wed, 27 Jan 2021, 12:19:13 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.