中国物理B ›› 2004, Vol. 13 ›› Issue (5): 625-632.doi: 10.1088/1009-1963/13/5/011
匡锦瑜1, 叶卫平1, 李晓文2, 唐国宁2, 吕华平3, 王世红4, 胡岗5
Lü Hua-Ping (吕华平)ab, Wang Shi-Hong (王世红)ac, Li Xiao-Wen (李晓文)a, Tang Guo-Ning (唐国宁)a, Kuang Jin-Yu (匡锦瑜)d, Ye Wei-Ping (叶卫平)d, Hu Gang (胡岗)ae
摘要: 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.
中图分类号: (Synchronization; coupled oscillators)