TY - JOUR
T1 - Improvement of cryptosystem based on iterating chaotic map
AU - Ben Farah, M. A.
AU - Kachouri, A.
AU - Samet, M.
PY - 2011/6/5
Y1 - 2011/6/5
N2 - In this letter we demonstrate that the improvement of cryptosystem based on iterating chaotic map proposed by Yong in 2007 are weak and this cryptosystem can be easily broken using chosen plaintext attack. Then, we give novel improvements to the proposed chaotic cryptosystem. We choose image as plaintext, some experimental tests like sensitivity on initial condition and correlation between two adjacent pixels are presented to show the performances of the new cryptosystem.
AB - In this letter we demonstrate that the improvement of cryptosystem based on iterating chaotic map proposed by Yong in 2007 are weak and this cryptosystem can be easily broken using chosen plaintext attack. Then, we give novel improvements to the proposed chaotic cryptosystem. We choose image as plaintext, some experimental tests like sensitivity on initial condition and correlation between two adjacent pixels are presented to show the performances of the new cryptosystem.
KW - chaotic cryptosystems
KW - chosen plaintext attack
KW - security
UR - http://www.scopus.com/inward/record.url?scp=78651419157&partnerID=8YFLogxK
U2 - 10.1016/j.cnsns.2010.09.005
DO - 10.1016/j.cnsns.2010.09.005
M3 - Article
AN - SCOPUS:78651419157
SN - 1007-5704
VL - 16
SP - 2543
EP - 2553
JO - Communications in Nonlinear Science and Numerical Simulation
JF - Communications in Nonlinear Science and Numerical Simulation
IS - 6
ER -