Affiliation:
1. Universiti Putra Malaysia, Malaysia
2. Universiti Kebangsaan Malaysia, Malaysia
Abstract
In 1998, M.S. Baptista proposed a chaotic cryptosystem using the ergodicity property of the simple lowdimensional and chaotic logistic equation. Since then, many cryptosystems based on Baptista’s work have been proposed. However, over the years research has shown that this cryptosystem is predictable and vulnerable to attacks and is widely discussed. Among the weaknesses are the non-uniform distribution of ciphertexts and succumbing to the one-time pad attack (a type of chosen plaintext attack). In this chapter the authors give a mathematical treatment to the phenomenon such that the cryptosystem would no longer succumb to the one-time pad attack and give an example that satisfies it.