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 language | English |
|---|---|
| Pages (from-to) | 409-419 |
| Number of pages | 11 |
| Journal | Algorithmica |
| Volume | 12 |
| Issue number | 4-5 |
| DOIs | |
| State | Published - Nov 1994 |
Keywords
- Complexity
- Encryption
- Huffman codes
- NP-completeness
- Prefix codes