论文信息 - Improving the security of a dynamic look-up table based chaotic cryptosystem

Improving the security of a dynamic look-up table based chaotic cryptosystem

In this brief, we analyze the cause of vulnerability of the original dynamic look-up table based chaotic encryption scheme in detail, and then propose the corresponding enhancement measures. Theoretical analysis and computer simulation indicate that the modified scheme is more secure than the original one

[1] Douglas R. Stinson,et al. Cryptography: Theory and Practice , 1995 .

[2] A. Baranovsky,et al. DESIGN OF ONE-DIMENSIONAL CHAOTIC MAPS WITH PRESCRIBED STATISTICAL PROPERTIES , 1995 .

[3] M. Baptista. Cryptography with chaos , 1998 .

[4] L. Kocarev,et al. Chaos and cryptography: block encryption ciphers based on chaotic maps , 2001 .

[5] K. Wong,et al. A Modified Chaotic Cryptographic Method , 2001, Communications and Multimedia Security.

[6] K. Wong,et al. A fast chaotic cryptographic scheme with dynamic look-up table , 2002 .

[7] A. Palacios,et al. Cryptography with cycling chaos , 2002 .

[8] Kwok-Wo Wong,et al. A combined chaotic cryptographic and hashing scheme , 2003 .

[9] G. Álvarez,et al. Cryptanalysis of dynamic look-up table based chaotic cryptosystems , 2003, nlin/0311043.

[10] Guanrong Chen,et al. On the security of the Yi-Tan-Siew chaotic cipher , 2004, IEEE Transactions on Circuits and Systems II: Express Briefs.

[11] Alfredo De Santis,et al. Security of public-key cryptosystems based on Chebyshev polynomials , 2004, IEEE Transactions on Circuits and Systems I: Regular Papers.