A fast chaotic cryptographic scheme with dynamic look-up table. (English) Zbl 0995.94029

Summary: We propose a fast chaotic cryptographic scheme based on iterating a logistic map. In particular, no random numbers need to be generated and the look-up table used in the cryptographic process is updated dynamically. Simulation results show that the proposed method leads to a substantial reduction in the encryption and decryption time. As a result, chaotic cryptography becomes more practical in the secure transmission of large multi-media files over public data communication network.


94A60 Cryptography
Full Text: DOI


[1] Grassi, G.; Mascolo, S., Electron. Lett., 34, 1844 (1998)
[2] Chu, Y. H.; Chang, S., Electron. Lett., 35, 271 (1999)
[3] Yang Tao, T.; Wu, C. W.; Chua, L. O., IEEE Trans. CASI, 44, 469 (1997) · Zbl 0884.94021
[4] Baptista, M. S., Phys. Lett. A, 240, 50 (1998) · Zbl 0936.94013
[5] Alvarez, E.; Fernandez, A.; Garcia, P.; Jimenez, J.; Marcano, A., Phys. Lett. A, 263, 373 (1999)
[6] Wong, W. K.; Lee, L. P.; Wong, K. W., Comput. Phys. Commun., 138, 234 (2001) · Zbl 0987.94033
[7] Schmitz, R., J. Franklin Inst., 338, 429 (2001) · Zbl 0979.94038
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.