Cryptanalysis of dynamic look-up table based chaotic cryptosystems

Abstract

In recent years many chaotic cryptosystems based on Baptista's seminal work have been proposed. We analyze the security of two of the newest and most interesting ones, which use a dynamically updated look-up table and also work as stream ciphers. We provide different attack techniques to recover the keystream used by the algorithms. The knowledge of this keystream provides the attacker with the same information as the key and thus the security is broken. We also show that the dependence on the plaintext, and not on the key, of the look-up table updating mechanism facilitates cryptanalysis.

12 pages, 0 figures, 6 tables, latex format

Cited by in corpus (8)

• A chaotic image encryption scheme owning temp-value feedback
• Baptista-type chaotic cryptosystems: Problems and countermeasures
• Breaking a Chaotic Cryptographic Scheme Based on Composition Maps
• Security problems with a chaos-based deniable authentication scheme
• Comment on novel public key encryption technique based on multiple chaotic systems
• Breaking a chaos-noise-based secure communication scheme
• Deciphering a novel image cipher based on mixed transformed Logistic maps
• Cryptanalyzing an image encryption algorithm based on scrambling and Veginere cipher