Complexity aspects of guessing prefix codes

A. S. Fraenkel, S. T. Klein

Research output: Contribution to journalArticlepeer-review

24 Scopus citations

Abstract

Given a natural language cleartext and a ciphertext obtained by Huffman coding, the problem of guessing the code is shown to be NP-complete for various variants of the encoding process.

Original languageEnglish
Pages (from-to)409-419
Number of pages11
JournalAlgorithmica
Volume12
Issue number4-5
DOIs
StatePublished - Nov 1994

Keywords

  • Complexity
  • Encryption
  • Huffman codes
  • NP-completeness
  • Prefix codes

Fingerprint

Dive into the research topics of 'Complexity aspects of guessing prefix codes'. Together they form a unique fingerprint.

Cite this