Low–complexity chaotic encryption system
R. Hasimoto–Beltrán
Department of Computer Sciences, Center for Research in Mathematics (CIMAT), Jalisco s/n, Col. Mineral de Valenciana, Guanajuato, 36240 Gto, México, Phone: +(52)–(473) 732–7155, Fax: +(52)–(473) 732–5749 e–mail: hasimoto@cimat.mx
Recibido el 7 de diciembre de 2006
Aceptado el 26 de enero de 2007
Abstract
Secure multimedia communication presents new challenges that are difficult to handle using by currently adopted encryption schemes (RSA—Rivest–Shamir–Adelman, AES—Advanced Encryption Standard, and IDEA—International Data Encryption algorithm) (28). It requires the processing of huge amounts of information at speeds ranging from Kilobits/sec (Kbs) to the order of Megabits/sec (Mbs). With this in mind, we propose a secure low–complexity encryption system based on a 4–array of independently iterated chaotic logistic maps with a new Spatiotemporal feedback scheme as a diffusion process. The robustness of the system to opponents' attack is enhanced by using a periodic three–level pseudo–random perturbation scheme, one at the system–key level and two at the map array level. An analysis of the proposed scheme regarding its vulnerability to attacks, statistical properties and implementation performance is presented. To the best of our knowledge we provide a simple and secure encryption system for real–time multimedia communications with the fastest software execution time reported in the literature.
Keywords: Discrete chaotic encryption; block ciphers; symmetric encryption.
Resumen
La seguridad en sistemas de comunicación de multimedia (texto, audio, imagen y video) representa un reto difícil de alcanzar para los actuales estandares de cifrado (RSA–Rivest–Shamir–Adelman, AES–Advanced Encryption Standard e IDEA–International Data Encryption algorithm) (28). Se requiere el procesamiento de grandes cantidades de información a velocidades que fluctúan entre los Kilobits/seg (Kbs) hasta los Megabits/seg (Mbs). Enfocados en este problema se propone un sistema de cifrado seguro y eficiente basado en un arreglo de mapas logísticos independientemente iterados junto con un sistema de retroalimentación espacio–temporal usado como proceso de difusión de la información. Adicionalmente se hace uso de tres niveles de perturbación para modificar el estado actual del sistema e incrementar así su robustez contra ataques de oponentes; una perturbación es a nivel de la llave del sistema y dos adicionales a nivel de los mapas caóticos. El análisis de resultados muestra excelentes propiedades estadísticas del sistema propuesto, sensibilidad a las condiciones iniciales y la mas alta velocidad de ejecución reportada en la literatura para llevar a cabo comunicaciones de multimedia en tiempo real.
Descriptores: Encriptación caótica discreta; cifradores de bloque; encriptación simétrica.
PACS: 05.45.Gg/Pq/Ac
]]>DESCARGAR ARTÍCULO EN FORMATO PDF
References
1. G. Álvarez, F. Montoya, G. Pastor, and M. Romera, Proc. IEEE Int. Carnahan Conf. Security Tech. (1999) 332. [ Links ]
2. G. Álvarez and S. Li,Phys. Lett. A 240 (1998) 50. [ Links ]
3. M.S. Baptista, Phys. Lett. A 240 (1998) 50. [ Links ]
4. P.M. Binder and R. V. Jensen, Phys. Rev. A 34 (1986) 4460. [ Links ]
5. J. Cernak, Phys. Lett. A 214 (1996) 151. [ Links ]
6. G. Chen, Y. Mao, and C.K. Chui, Chaos Solit. & Fract. 21 (2004) 749. [ Links ]
7. F. Dachselt and W. Schuwartz, IEEE Trans. Circ. Syst.–I 48 (2001) 1498. [ Links ]
8. S. Deng, L. Zhang, and D. Xiao, Lecture Notes in Computer Science 3497 (2005) 868. [ Links ]
9. A. Fog, Chaotic random number generators with random cycle lengths http://www.agner.org/random/theory/chaosran.pdf. [ Links ]
10. I Fridrich, Int. J. Bifurcation Chaos 8 (1998) 1259. [ Links ]
11. Z. Guan, F. Huang, and W. Guan, Phys. Lett. A 346 (2005) 153. [ Links ]
12. T. Habutsu, Y. Nishio, I. Sasase, and S. Mori, Advances in Cryptology (EUROCRYPT'91) (Springer–Verlag, 1991) p. 127. [ Links ]
13. Z. Han, W.X. Feng, L.Z. Hui, L.D. Hai, and L.Y Chou, Proc. IEEE Int. Conf. Robotics Intelligent Systems and Signal Processing, (2003) 778. [ Links ]
14. G. Jakimoski and L. Kocarev, IEEE Trans. Circ. Syst.–I 48 (2001) 163. [ Links ]
15. G. Jakimoski and L. Kocarev, Phys. Lett. A 291 (2001) 381. [ Links ]
16. L. Kocarev, IEEE Circ. Syst. Mag. 1 (2001) 6. [ Links ]
17. S. Li, X. Mou, Z. Ji , J. Zhang, and Y Cai, Physics Communications 153 (2003) 52. [ Links ]
18. S. Lian, J. Sun , Z. Wang, and Y Dai, 8th Int. Conf. Control, Automation, Robotics and Vision (2004) 126. [ Links ]
19. R.F. Machado, M.S. Baptista, and C. Grebogi, Chaos, Solitons and Fractals 21 (2004) 1265. [ Links ]
20. T. Paraskeve, N. Klimis, and K. Stefanos, ACM Multimedia '04. [ Links ]
21. N.K. Pareek, V. Patidar, and K.K. Sud, Phys. Lett. A 309 (2003) 75. [ Links ]
22. K.M. Roskin and J.B. Casper, From Chaos to cryptography (2002); krish@cats.ucsc.edu. [ Links ]
23. S. Tao, W. Ruli, and Y Yixun, Electronics Letters 34 (1998) 873. [ Links ]
24. K.W. Tang and W. Tang, IEEE Inter. Conf. Industrial tech. (ICIT) (2005) 571. [ Links ]
25. W. Wang, Z. Liu, and B. Hu, Phys. Rev. Lett. 84 (2000) 2610. [ Links ]
26. K. Wong K, Phys. Lett. A 298 (2002) 238. [ Links ]
27. J. Yen and J. Guo, IEEE Int. Symp. Circ. Syst. (ISCAS–2000) IV (2000) 49. [ Links ]
28. M. Yang, N. Bourbakis, and S. Li, IEEE Potentials (2004) 28. [ Links ] ]]>