On the Security of the Yi-Tan-Siew Chaos-Based Cipher

2004/02/29 by Shujun Li, Guanrong Chen, Xuanqin Mou
Computer Science · Physics and Astronomy · #cs.CR #cs.PF #nlin.CD

paper · pdf · doi:10.1109/tcsii.2004.838657

published as IEEE Trans. CAS-II, vol. 51, no. 12, pp. 665-669, 2004 · 5 pages, 3 figures, IEEEtrans.cls v 1.6

arxiv created 2004/12/01 · arxiv updated 2009/12/01

Abstract

This paper presents a comprehensive analysis on the security of the Yi-Tan-Siew chaotic cipher proposed in [IEEE TCAS-I 49(12):1826-1829 (2002)]. A differential chosen-plaintext attack and a differential chosen-ciphertext attack are suggested to break the sub-key K, under the assumption that the time stamp can be altered by the attacker, which is reasonable in such attacks. Also, some security Problems about the sub-keys α and β are clarified, from both theoretical and experimental points of view. Further analysis shows that the security of this cipher is independent of the use of the chaotic tent map, once the sub-key K is removed via the proposed suggested differential chosen-plaintext attack.

Related

• Differential-like Chosen Cipher Attack on A Spatiotemporally Chaotic Cryptosystem
• Cryptanalysis and design for a family of plaintext-non-delayed chaotic ciphers
• On the use of dynamical systems in cryptography
• Some hints for the design of digital chaos-based cryptosystems: lessons learned from cryptanalysis
• A Basic Framework for the Cryptanalysis of Digital Chaos-Based Cryptography