Compression Cryptosystem

Yoav Gross; Shmuel T. Klein; Elina Opalinsky; Rivka Revivo; Dana Shapira

doi:10.1093/comjnl/bxaf023

Compression Cryptosystem

Yoav Gross
, Shmuel T. Klein
, Elina Opalinsky
, Rivka Revivo
, Dana Shapira

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

A compression cryptosystem is a single coding process, the output of which is both reduced in space and secure against unauthorized decoding. Considering both Huffman and arithmetic coding, this paper proposes to apply repeatedly minor changes to the compression model, with negligible deterioration of its optimality. The cumulative impact of a large number of such changes leads to completely different ciphertexts, which can be decrypted only if a given secret key is known. The security of the system is based on the NP-completeness of a problem related to breaking the code. Several variants are suggested, and their results are tested in various settings, including for security against chosen plaintext attacks.

Original language	English
Pages (from-to)	1062-1073
Number of pages	12
Journal	Computer Journal
Volume	68
Issue number	8
DOIs	https://doi.org/10.1093/comjnl/bxaf023
State	Published - 1 Aug 2025

Access to Document

10.1093/comjnl/bxaf023

Cite this

@article{3e50b540292347768161f3b4c67d1161,

title = "Compression Cryptosystem",

abstract = "A compression cryptosystem is a single coding process, the output of which is both reduced in space and secure against unauthorized decoding. Considering both Huffman and arithmetic coding, this paper proposes to apply repeatedly minor changes to the compression model, with negligible deterioration of its optimality. The cumulative impact of a large number of such changes leads to completely different ciphertexts, which can be decrypted only if a given secret key is known. The security of the system is based on the NP-completeness of a problem related to breaking the code. Several variants are suggested, and their results are tested in various settings, including for security against chosen plaintext attacks.",

author = "Yoav Gross and Klein, \{Shmuel T.\} and Elina Opalinsky and Rivka Revivo and Dana Shapira",

note = "Publisher Copyright: {\textcopyright} The Author(s) 2025.",

year = "2025",

month = aug,

day = "1",

doi = "10.1093/comjnl/bxaf023",

language = "אנגלית",

volume = "68",

pages = "1062--1073",

journal = "Computer Journal",

issn = "0010-4620",

publisher = "Oxford University Press",

number = "8",

}

TY - JOUR

T1 - Compression Cryptosystem

AU - Gross, Yoav

AU - Klein, Shmuel T.

AU - Opalinsky, Elina

AU - Revivo, Rivka

AU - Shapira, Dana

PY - 2025/8/1

Y1 - 2025/8/1

N2 - A compression cryptosystem is a single coding process, the output of which is both reduced in space and secure against unauthorized decoding. Considering both Huffman and arithmetic coding, this paper proposes to apply repeatedly minor changes to the compression model, with negligible deterioration of its optimality. The cumulative impact of a large number of such changes leads to completely different ciphertexts, which can be decrypted only if a given secret key is known. The security of the system is based on the NP-completeness of a problem related to breaking the code. Several variants are suggested, and their results are tested in various settings, including for security against chosen plaintext attacks.

AB - A compression cryptosystem is a single coding process, the output of which is both reduced in space and secure against unauthorized decoding. Considering both Huffman and arithmetic coding, this paper proposes to apply repeatedly minor changes to the compression model, with negligible deterioration of its optimality. The cumulative impact of a large number of such changes leads to completely different ciphertexts, which can be decrypted only if a given secret key is known. The security of the system is based on the NP-completeness of a problem related to breaking the code. Several variants are suggested, and their results are tested in various settings, including for security against chosen plaintext attacks.

UR - https://www.scopus.com/pages/publications/105013265633

U2 - 10.1093/comjnl/bxaf023

DO - 10.1093/comjnl/bxaf023

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:105013265633

SN - 0010-4620

VL - 68

SP - 1062

EP - 1073

JO - Computer Journal

JF - Computer Journal

IS - 8

ER -

Compression Cryptosystem

Abstract

Access to Document

Other files and links

Fingerprint

Cite this