Kamel Ariffin, Muhammad Rezal (2008) Chaos Based Cryptography An Alternative to Algebraic Cryptography. Math Digest : Research Bulletin Institute for Mathematical Research, 2 (1). pp. 41-47. ISSN 1985-2436
In this paper we will first discuss cryptography from a historical point of view in order to understand the motivation behind this science. We will discuss the earliest form of cryptography before fast forwarding to the current modem forms of cryptography. We will then mention issues surrounding current modem cryptographic methods before introducing chaos based cryptography. The relationship between chaos and cryptography makes it natural to employ chaotic systems to design new cryptosystems. It is based on the facts that chaotic signals are usually noise-like and chaotic systems are very sensitive to initial conditions. Their sensitivity to initial conditions and their spreading out of trajectories over the whole interval seems to be a model that satisfies the classic Shannon requirements of confusion and diffusion  From 1989 onwards, many different chaotic encryption systems have been proposed. The most celebrated chaotic cryptosystem is based on the ergodicity property of chaotic maps  and has received more and more attentions in the past literature [3-17]. Introduced by Baptista in 1998, it is able to produce different ciphers for the same plaintext. It was cracked by Alvarez in 2003 via the one-time pad attack. In 2008, M.R.K.Ariffin and M.S.M.Noorani  engaged the attack and devised a counter measure against it.
|Faculty or Institute:||Institute for Mathematical Research|
|Publisher:||Institute for Mathematical Research|
|Deposited By:||Mohd Nezeri Mohamad|
|Deposited On:||24 May 2011 08:49|
|Last Modified:||27 May 2013 07:52|
Repository Staff Only: Edit item detail
Document Download Statistics
This item has been downloaded for since 24 May 2011 08:49.