Chosen plaintext attack on a cryptosystem with discretized skew tent map

An encryption system with discretized skew tent map has been proposed recently by N. Masuda . However, there is a fundamental weakness with this chaotic cryptographic scheme. In this paper, a chosen plaintext attack requiring only two plaintexts is proposed. An improved version of this attack that narrows the key space need to be searched is also suggested. The test results demonstrate that this encryption cryptosystem is easily broken under the proposed chosen plaintext attack.