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.
Original language | English |
---|---|
Title of host publication | Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Proceedings |
Editors | Frank Drewes, Carlos Martín-Vide, Bianca Truthe |
Publisher | Springer Verlag |
Pages | 143-154 |
Number of pages | 12 |
ISBN (Print) | 9783319537320 |
DOIs | |
State | Published - 2017 |
Event | 11th International Conference on Language and Automata Theory and Applications, LATA 2017 - Umea, Sweden Duration: 6 Mar 2017 → 9 Mar 2017 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 10168 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 11th International Conference on Language and Automata Theory and Applications, LATA 2017 |
---|---|
Country/Territory | Sweden |
City | Umea |
Period | 6/03/17 → 9/03/17 |
Bibliographical note
Publisher Copyright:© Springer International Publishing AG 2017.