Security analysis of a spatiotemporal-chaos-based cryptosystem

An S-box modified one-way coupled map lattice is applied as a chaotic cryptograph. The security of the system is evaluated from various attacks currently used, including those based on error function analysis, statistical property analysis, and known-plaintext and chosen-ciphertext analytical computations. It is found that none of the above attacks can be better than the brute force attack of which the cost is exhaustively quantitated by the key number in the key space. Also, the system has fairly fast encryption (decryption) speed, and has extremely long period for finite-precision computer realization of chaos. It is thus argued that this chaotic cryptosystem can be a hopeful candidate for realistic service of secure communications.