Range GLS-Coding: A Scheme of Simultaneous Data Compression and Encryption

Muhammad Usama, Nordin Zakaria

Abstract


This paper presents an improved version of GLS-coding for simultaneous data compression and encryption called Range GLS-coding. It removes implementation issue of infinite precision real numbers due to long products of real numbers in GLS-Coding. This improvement increases the algorithm efficiency to almost double. Furthermore, encryption quality is improved by masking pseudorandom keystream; the secret key is incorporated by changing the direction and performing cyclic-shift operation in a complex piecewise linear chaotic map (PWLCM). Experimental results demonstrate that proposed algorithm has acceptable security and compression features. The overall algorithm provides simultaneous data encryption and compression and useful for real-time applications.


Keywords


GLS-Coding; compression; encryption; simultaneous compression and encryption

Full Text:

PDF

References


T. Xiang, X. Liao, G. Tang, Y. Chen and K.-w. Wong, "A novel block cryptosystem based on iterating a chaotic map," Physics Letters A, vol. 349, no. 1, pp. 109-115, 2006.

M. S. Baptista, "Cryptography with chaos," Physics Letters A , vol. 240, no. 1, pp. 50-54, 1998.

C.-P. Wu and C.-C. Kuo, "Design of integrated multimedia compression and encryption systems," Multimedia, IEEE Transactions on, vol. 7, no. 5, pp. 828-839, 2005.

H. Hermassi, R. Rhouma and S. Belghith, "Joint compression and encryption using chaotically mutated Huffman trees," Communications in nonlinear science and numerical simulation, vol. 15, no. 10, pp. 2987-2999, 2010.

YU, Hai, "A chaos-based joint compression and encryption scheme using mutated adaptive Huffman Tree," in Fifth International Workshop on Chaos-fractals Theories and Applications (IWCFTA), 2012.

M. Grangetto, E. Magli and G. Olmo, "Multimedia selective encryption by means of randomized arithmetic coding," Multimedia, IEEE Transactions on, vol. 8, no. 5, pp. 905-917, 2006.

J. Zhou, O. C. Au and P.-W. Wong, "Adaptive chosen-ciphertext attack on secure arithmetic coding," Signal Processing, IEEE Transactions on, vol. 57, no. 5, pp. 1825-1838, 2009.

M. B. Luca, A. Serbanescu, S. Azou and G. Burel, "A new compression method using a chaotic symbolic approach," in IEEE Commun. Conf, 2004.

N. Nagaraj, P. G. Vaidya and K. G. Bhat., "Arithmetic coding as a non-linear dynamical system," Communications in Nonlinear Science and Numerical Simulation, vol. 14, no. 4, pp. 1013-1020, 2009.

K.-W. Wong, Q. Lin and J. Chen, "Simultaneous arithmetic coding and encryption using chaotic maps," Circuits and Systems II: Express Briefs, IEEE Transactions on, vol. 57, no. 2, pp. 146-150, 2010.

G. Alvarez and S. Li., "Some basic cryptographic requirements for chaos-based cryptosystems," International Journal of Bifurcation and Chaos, vol. 16, no. 8, pp. 2129-2151, 2006.

R. C. Pasco, "Source coding algorithms for fast data compression," Doctoral dissertation, Stanford University, 1976.




DOI: http://dx.doi.org/10.26713%2Fjims.v8i4.557

eISSN 0975-5748; pISSN 0974-875X