ANS-based compression and encryption with 128-bit security

Seyit Camtepe, Jarek Duda, Arash Mahboubi, Paweł Morawiecki, Surya Nepal, Marcin Pawłowski, Josef Pieprzyk

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)
31 Downloads (Pure)


The bulk of Internet interactions is highly redundant and also security sensitive. To reduce communication bandwidth and provide a desired level of security, a data stream is first compressed to squeeze out redundant bits and then encrypted using authenticated encryption. This generic solution is very flexible and works well for any pair of (compression, encryption) algorithms. Its downside, however, is the fact that the two algorithms are designed independently. One would expect that designing a single algorithm that compresses and encrypts (called compcrypt) should produce benefits in terms of efficiency and security. The work investigates how to design a compcrypt algorithm using the ANS entropy coding. First, we examine basic properties of ANS and show that a plain ANS with a hidden encoding table can be broken by statistical attacks. Next, we study ANS behavior when its states are chosen at random. Our compcrypt algorithm is built using ANS with randomized state jumps and a sponge MonkeyDuplex encryption. Its security and efficiency are discussed. The design provides 128-bit security for both confidentiality and integrity/authentication. Our implementation experiments show that our compcrypt algorithm processes symbols with a rate up to 269 MB/s (with a slight loss of compression rate) 178 MB/s.

Original languageEnglish
Pages (from-to)1051–1067
Number of pages17
JournalInternational Journal of Information Security
Issue number5
Early online date13 Jul 2022
Publication statusPublished - Oct 2022


Dive into the research topics of 'ANS-based compression and encryption with 128-bit security'. Together they form a unique fingerprint.

Cite this