| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 496161 | Applied Soft Computing | 2012 | 8 Pages |
Here we modify a chaos-based joint compression and encryption algorithm previously proposed by us. Two modifications are suggested for improving the compression performance and generating ciphertext with variable length, respectively. The first goal is achieved by counting the number of distinct symbols visited by the chaotic search orbit, rather than the total number of iterations of the chaotic map. The second objective is realized by introducing a user-chosen parameter to determine the ratio between the search and the mask modes. The performance of the modified algorithm is justified by simulation results using standard test files.
Graphical abstractFigure optionsDownload full-size imageDownload as PowerPoint slideHighlights► A modified chaos-based joint compression and encryption scheme is proposed. ► Encrypt the number of distinct symbols visited to improve the compression ratio. ► Ciphertext length can be controlled by a user-chosen parameter. ► It provides a better performance than existing approaches.
