Reconstructing applicable chaotic Baptista-type symmetric cryptosystem

This work, introduces a method to repair a cryptosystem based on a chaotic dynamical system. Baptista exploited the chaotic property of the logistic equation f(x) = b x (1 - x) to develop a cryptosystem. This cryptosystem has the ability to produce various ciphers responding to the same message i...

Full description

Saved in:

Bibliographic Details
Main Author:	Daud, Muhamad Azlan
Format:	Thesis
Language:	English
Published:	2014
Subjects:	Cryptography - Mathematics
Online Access:	http://psasir.upm.edu.my/id/eprint/76042/1/IPM%202014%2013%20-%20IR.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-upm-ir.76042
record_format	uketd_dc
spelling	my-upm-ir.760422019-11-26T07:10:28Z Reconstructing applicable chaotic Baptista-type symmetric cryptosystem 2014-09 Daud, Muhamad Azlan This work, introduces a method to repair a cryptosystem based on a chaotic dynamical system. Baptista exploited the chaotic property of the logistic equation f(x) = b x (1 - x) to develop a cryptosystem. This cryptosystem has the ability to produce various ciphers responding to the same message input. Alvarez through his one-time pad attack successfully attacked the Baptista cyptosystem. Ariffin attempted to modify the cryptosystem to enhance the security of the original Baptista’s cryptosystem. Rhouma identified a flaw in the method Ariffin put forward, specifically in step 4 of the encryption procedure, where it does not implement a oneto- one operation resulting in failure to decrypt the ciphertext. The method is based on the Fractal and Iterated System (IFS), where an in-depth study on Fractal, Chaos and Cryptography is needed to assist in actualizing the research objectives. The algorithm is developed to counter the one-time pad attack. This recommended encryption algorithm also overcomes the flaw in Ariffin’s encryption procedure. The modified Baptista type cryptosystem suffers from message expansion that goes against the conventional methodology of a symmetric cryptosystem. As a result, we studied the idea of Huffman encoding. We then designed a new compression algorithm developed using ideas from the Huffman coding. Finally, the compression algorithm is applied onto the modified Baptista cryptosystem to show a possible practical deployment of the Baptista cryptosystem and to also produce better compression ratio. Cryptography - Mathematics 2014-09 Thesis http://psasir.upm.edu.my/id/eprint/76042/ http://psasir.upm.edu.my/id/eprint/76042/1/IPM%202014%2013%20-%20IR.pdf text en public masters Universiti Putra Malaysia Cryptography - Mathematics
institution	Universiti Putra Malaysia
collection	PSAS Institutional Repository
language	English
topic	Cryptography - Mathematics
spellingShingle	Cryptography - Mathematics Daud, Muhamad Azlan Reconstructing applicable chaotic Baptista-type symmetric cryptosystem
description	This work, introduces a method to repair a cryptosystem based on a chaotic dynamical system. Baptista exploited the chaotic property of the logistic equation f(x) = b x (1 - x) to develop a cryptosystem. This cryptosystem has the ability to produce various ciphers responding to the same message input. Alvarez through his one-time pad attack successfully attacked the Baptista cyptosystem. Ariffin attempted to modify the cryptosystem to enhance the security of the original Baptista’s cryptosystem. Rhouma identified a flaw in the method Ariffin put forward, specifically in step 4 of the encryption procedure, where it does not implement a oneto- one operation resulting in failure to decrypt the ciphertext. The method is based on the Fractal and Iterated System (IFS), where an in-depth study on Fractal, Chaos and Cryptography is needed to assist in actualizing the research objectives. The algorithm is developed to counter the one-time pad attack. This recommended encryption algorithm also overcomes the flaw in Ariffin’s encryption procedure. The modified Baptista type cryptosystem suffers from message expansion that goes against the conventional methodology of a symmetric cryptosystem. As a result, we studied the idea of Huffman encoding. We then designed a new compression algorithm developed using ideas from the Huffman coding. Finally, the compression algorithm is applied onto the modified Baptista cryptosystem to show a possible practical deployment of the Baptista cryptosystem and to also produce better compression ratio.
format	Thesis
qualification_level	Master's degree
author	Daud, Muhamad Azlan
author_facet	Daud, Muhamad Azlan
author_sort	Daud, Muhamad Azlan
title	Reconstructing applicable chaotic Baptista-type symmetric cryptosystem
title_short	Reconstructing applicable chaotic Baptista-type symmetric cryptosystem
title_full	Reconstructing applicable chaotic Baptista-type symmetric cryptosystem
title_fullStr	Reconstructing applicable chaotic Baptista-type symmetric cryptosystem
title_full_unstemmed	Reconstructing applicable chaotic Baptista-type symmetric cryptosystem
title_sort	reconstructing applicable chaotic baptista-type symmetric cryptosystem
granting_institution	Universiti Putra Malaysia
publishDate	2014
url	http://psasir.upm.edu.my/id/eprint/76042/1/IPM%202014%2013%20-%20IR.pdf
_version_	1747813106110693376

Reconstructing applicable chaotic Baptista-type symmetric cryptosystem

Similar Items