Abstract | ||
---|---|---|
An approach for improving the compression performance of an existing chaos-based joint compression and encryption scheme is proposed. The lookup table used for encryption is dynamically updated in the searching process. Once a partition not matched with the target symbol is visited, this and other partitions mapped to the same symbol are reallocated to a nonvisited symbol. Therefore, the target symbol eventually associates with more partitions and fewer number of iterations are needed to find it. As a result, expansion of the ciphertext is avoided, and the compression ratio is improved. Simulation results show that the proposed modification leads to a better compression performance, whereas the execution efficiency is comparable. The security of the modified scheme is also analyzed in detail. |
Year | DOI | Venue |
---|---|---|
2011 | 10.1109/TCSII.2011.2106316 | IEEE Trans. on Circuits and Systems |
Keywords | Field | DocType |
MULTIMEDIA,CRYPTOGRAPHY,DESIGN | Lookup table,Cryptography,Algorithm,Encryption,Compression ratio,Ciphertext,Data compression,Partition (number theory),Trajectory,Mathematics | Journal |
Volume | Issue | ISSN |
58 | 2 | 1549-7747 |
Citations | PageRank | References |
21 | 1.31 | 11 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jianyong Chen | 1 | 722 | 40.93 |
Junwei Zhou | 2 | 118 | 16.64 |
Kwok-Wo Wong | 3 | 1255 | 93.89 |