USE OF NEW EFFICIENT LOSSLESS DATA COMPRESSION METHOD IN TRANSMITTING ENCRYPTED BAPTISTA SYMMETRIC CHAOTIC CRYPTOSYSTEM DATA
DOI:
https://doi.org/10.11113/jt.v78.8976Keywords:
Lossless, lossy, baptista cryptosystem, Huffman, coding, encodingAbstract
A new compression algorithm used to ensure a modified Baptista symmetric cryptosystem which is based on a chaotic dynamical system to be applicable is proposed. The Baptista symmetric cryptosystem able to produce various ciphers responding to the same message input. This modified Baptista type cryptosystem suffers from message expansion that goes against the conventional methodology of a symmetric cryptosystem. A new lossless data compression algorithm based on theideas from the Huffman coding for data transmission is proposed.This new compression mechanism does not face the problem of mapping elements from a domain which is much larger than its range.Our new algorithm circumvent this problem via a pre-defined codeword list. The purposed algorithm has fast encoding and decoding mechanism and proven analytically to be a lossless data compression technique.
References
Alvarez, Montoya, G., Romera, F. M. and Pastor. 2000. Cryptanalysis of a chaotic encryption system from Phys. Lett. A. 276: 191-196.
Ferreira, A. J., Oliveira, A. L. and Figueiredo, M. A. T. 2009. On the Suitability of Suffix Arrays for Lempel-Ziv Data Compression. DCC. 2009: 444.
Baptista, M. S. 1998. Cryptography with Chaos from Phys. Lett. A. 240: 50-54.
Daud, M. A. and Ariffin M. R. K. 2013. A New Efficient Analytically Proven Lossless Data Compression for Data Transmission Technique. Malaysian Journal of Mathematical Sciences. 7(S): 117-129.
Burrows, M. and Wheeler, D. J. 1994. A Block-sorting Lossless Data Compression Algorithm. SRC Research Report. 124: 1-18.
Ward, M. D. 2005. Exploring Data Compression via Binary Trees. 143-150.
Ariffin, M. R. K., Al-Saidi, N. M. G., Said, M. R. M., Mahad, Z. and Daud, M. A. 2012. A New Direction in Utilization of Chaotic Fractal Functions for Cryptosystems. Book Chapter in Applications of Chaos and Nonlinear Dynamics in Science and Engineering – Vol 2. Understanding Complex System. Berlin Heidelberg: Springer-Verlag. 233-248.
Ahmadi, O. and Menezes. 2005. Irreducible Polynomials of Maximum Weight. CACR Technical Reports.
Hellebrand, S. and Wurtenberger, A. 2002. Alternating Run-Length Coding- A Technique for Improved Test Data Compression. Handout IEEE International Workshop on Test Resource Partitioning. USA: Baltimore, MD.
Pathak, S., Singh S., Singh S., Jain M. and Sharma A. 2011. Data Compression Scheme of Dynamic Huffman Code for Different Languages. 2011 International Conference i=on Information and Network Technology. 4: 201-205.
Roman S. 1997. Introduction to Coding and Information Theory. Springer.
Downloads
Published
Issue
Section
License
Copyright of articles that appear in Jurnal Teknologi belongs exclusively to Penerbit Universiti Teknologi Malaysia (Penerbit UTM Press). This copyright covers the rights to reproduce the article, including reprints, electronic reproductions, or any other reproductions of similar nature.