z-logo
open-access-imgOpen Access
Chaos-Based Simultaneous Compression and Encryption for Hadoop
Author(s) -
Muhammad Usama,
Nordin Zakaria
Publication year - 2017
Publication title -
plos one
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.99
H-Index - 332
ISSN - 1932-6203
DOI - 10.1371/journal.pone.0168207
Subject(s) - encryption , computer science , data compression , key (lock) , 40 bit encryption , cryptography , compression (physics) , probabilistic encryption , theoretical computer science , algorithm , computer hardware , computer engineering , computer network , computer security , materials science , composite material
Data compression and encryption are key components of commonly deployed platforms such as Hadoop. Numerous data compression and encryption tools are presently available on such platforms and the tools are characteristically applied in sequence, i.e., compression followed by encryption or encryption followed by compression. This paper focuses on the open-source Hadoop framework and proposes a data storage method that efficiently couples data compression with encryption. A simultaneous compression and encryption scheme is introduced that addresses an important implementation issue of source coding based on Tent Map and Piece-wise Linear Chaotic Map (PWLM), which is the infinite precision of real numbers that result from their long products. The approach proposed here solves the implementation issue by removing fractional components that are generated by the long products of real numbers. Moreover, it incorporates a stealth key that performs a cyclic shift in PWLM without compromising compression capabilities. In addition, the proposed approach implements a masking pseudorandom keystream that enhances encryption quality. The proposed algorithm demonstrated a congruent fit within the Hadoop framework, providing robust encryption security and compression.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here