Use of new efficient lossless data compression method in transmitting encrypted Baptista symmetric chaotic cryptosystem data

Muhamad Azlan Daud and Muhammad Rezal Kamel Ariffin and S. Kularajasingam and Che Haziqah Che Hussin and Nurliyana Juhan and Mohd Mughti Hasni (2016) Use of new efficient lossless data compression method in transmitting encrypted Baptista symmetric chaotic cryptosystem data. Jurnal Teknologi, 78 (6-4). pp. 61-68. ISSN 2180-3722

[img]
Preview
Text
Use_of_new_efficient_lossless_data_compression_method_in_transmitting_encrypted_Baptista_symmetric_chaotic_cryptosystem_data.pdf

Download (42kB) | Preview
[img]
Preview
Text
Use of new efficient lossless data compression method in transmitting encrypted Baptista symmetric chaotic cryptosystem data.pdf

Download (488kB) | Preview

Abstract

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 the ideas 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.

Item Type: Article
Keyword: Baptista cryptosystem, Coding, Encoding, Huffman, Lossless, Lossy
Subjects: Q Science > Q Science (General)
Department: FACULTY > Faculty of Science and Natural Resources
Depositing User: ADMIN ADMIN
Date Deposited: 12 Aug 2016 11:32
Last Modified: 19 Oct 2020 21:28
URI: https://eprints.ums.edu.my/id/eprint/13864

Actions (login required)

View Item View Item