Joint compression and encryption using chaotically mutated Huffman trees. (English) Zbl 1222.94032
Summary: We introduce a new scheme for joint compression and encryption using the Huffman codec. A basic tree is first generated for a given message and then based on a keystream generated from a chaotic map and depending from the input message, the basic tree is mutated without changing the statistical model. Hence a symbol can be coded by more than one codeword having the same length. The security of the scheme is tested against the known plaintext attack and the brute force attack. Performance analysis including encryption/decryption speed, additional computational complexity and compression ratio are given.
MSC:
| 94A60 | Cryptography |
| 37N35 | Dynamical systems in control |
| 37D45 | Strange attractors, chaotic dynamics of systems with hyperbolic behavior |
References:
| [1] | Furht, B.; Socek, D.; Eskicioglu, A. M., Fundamentals of multimedia encryption techniques. Fundamentals of multimedia encryption techniques, A chapter in multimedia security handbook (2005), CRC Press |
| [2] | Huffman DA. A method for the construction of minimum redundancy codes. In: Proc. IRE; 1952. p. 1098-101.; Huffman DA. A method for the construction of minimum redundancy codes. In: Proc. IRE; 1952. p. 1098-101. · Zbl 0137.13605 |
| [3] | Langdon, G. G.; Rissanen, J. J., Arithmetic coding, IBM J Res Dev, 23, 2, 149-162 (1979) · Zbl 0404.94005 |
| [4] | Grangetto, Marco; Magli, Enrico; Olmo, Gabriella, Multimedia selective encryption by means of randomized arithmetic coding, IEEE Trans Multimedia, 8, 5, 905-917 (2006), October |
| [5] | Wen, Jiangtao; Kim, Hyungjin; Villasenor, John D., Binary arithmetic coding with key-based interval splitting, IEEE Sig Process Lett, 13, 2, 69-72 (2006), February |
| [6] | Kim, Hyungjin; Wen, Jiangtao; Villasenor, John D., Secure arithmetic coding, IEEE Trans Sig Process, 55, 5, 2263-2272 (2007), May · Zbl 1391.94865 |
| [7] | Nagaraj, Nithin; Vaidya, Prabhakar G.; Bhat, Kishor G., Arithmetic coding as a non-linear dynamical system, Commun Nonlinear Sci Numer Simul, 14, 4, 1013-1020 (2009) · Zbl 1221.94037 |
| [8] | Wu, C. P.; Kuo, C. C.J., Design of integrated multimedia compression and encryption systems, IEEE Trans Multimedia, 7, 5, 828-839 (2005), October |
| [9] | Jakimoski, Goce; Subbalakshmi, K. P., Cryptanalysis of some multimedia encryption schemes, IEEE Trans Multimedia, 10, 3, 330-338 (2008) |
| [10] | Stinson, D. R., Cryptography: theory and practice (1995), CRC Press: CRC Press Boca Raton, FL · Zbl 0855.94001 |
| [11] | Li, S.; Chen, G.; Mou, X., On the dynamical degradation of digital piecewise linear chaotic maps, Int J Bifurc Chaos, 15, 10, 3119-3151 (2005) · Zbl 1093.37514 |
| [12] | Rhouma Rhouma, David Arroyo, Safya Belghith. A new color image cryptosystem based on a piecewise linear chaotic map. CDROM SSD’09.; Rhouma Rhouma, David Arroyo, Safya Belghith. A new color image cryptosystem based on a piecewise linear chaotic map. CDROM SSD’09. · Zbl 1223.94019 |
| [13] | David Arroyo. Framework for the analysis and design of encryption strategies based on discrete-time chaotic dynamical systems. Thesis report. Area de conocimiento de Fisica Aplicada y Matematica Aplicada. Spain; 2009.; David Arroyo. Framework for the analysis and design of encryption strategies based on discrete-time chaotic dynamical systems. Thesis report. Area de conocimiento de Fisica Aplicada y Matematica Aplicada. Spain; 2009. |
| [14] | Alvarez, G.; Li, S., Some basic cryptographic requirements for chaos-based cryptosystems, Int J Bifurc Chaos, 16, 8, 2129-2151 (2006) · Zbl 1192.94088 |
| [15] | Available: ftp://ftp.cpsc.ucalgary.ca/pub/projects/text.compression.corpus; Available: ftp://ftp.cpsc.ucalgary.ca/pub/projects/text.compression.corpus |
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.
