Abstract | ||
---|---|---|
A compression cryptosystem based on adaptive arithmetic coding is proposed, in which the updates of the frequency tables for the underlying alphabet are done selectively, according to some secret key K. We give empirical evidence that the compression performance is not hurt, and discuss also aspects of the system being used as an encryption method. |
Year | DOI | Venue |
---|---|---|
2017 | 10.1007/978-3-319-53733-7_10 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Multiple encryption,Discrete mathematics,Compression (physics),Computer science,Arithmetic,Disk encryption theory,Cryptosystem,Theoretical computer science,Encryption,Huffman coding,Arithmetic coding,Context-adaptive binary arithmetic coding | Conference | 10168 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
9 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Shmuel T. Klein | 1 | 434 | 77.80 |
Dana Shapira | 2 | 144 | 32.15 |