.png){kind=icon}
返回
Concurrent encryption and lossless compression using inversion ranks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jisa.2023.103587.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
For secure and efficient transmission or storage, data files are commonly compressed and encrypted. In this work, we introduce a cost-effective encryption method of files as a built-in component of a lossless compression algorithm, thus avoiding the added cost of employing two separate processes. We have shown in earlier studies that preprocessing data with Burrows-Wheeler Transformation followed by Inversion Ranking transformation in advance of the utilization of an entropy coder resulted in an extremely effective general-purpose lossless compression technique. In our proposed algorithm, we isolate the inversion frequency vector obtained from the Inversion Ranking transformation and transmit the compressed file. Since the inversion frequency vector is necessary for decompression, we use it as our secret key and transmit it over a secure channel. Compared to the size of a data file, its frequency vector is rather small. Thus, encrypting only the inversion frequency vector, instead of the entire compressed file, results in substantial savings in computational cost. We demonstrate that the proposed technique is effective and resistant to common attacks on image and audio data sets.
Keyword:
Data security
Lossless data compression
Burrows-Wheeler transformation
Inversion ranking
Multimedia security
期刊
IF:
3.7
论文数:
2.0K
被引数:
4.9K
机构
引用论文
A new color image encryption scheme based on DNA sequences and multiple improved 1D chaotic maps
PREAI
分享收藏
分享收藏On scrambling the Burrows-Wheeler transform to provide privacy in lossless compression.png)
COMPUTERS & SECURITY
COMPUTERS & SECURITYIF5.4
PREAI
分享收藏Bit-level color image encryption algorithm based on coarse-grained logistic map and fractional chaos
PREAI
分享收藏
查看更多内容