Crypto-Compression Prefix Coding
Ruy Luiz Milidiú, Claudio Gomes de Mello · 2006
Summary form only given. This paper proposes some additional strategies to prefix data compression algorithms to achieve both compressed and ciphered data with the use of a provably secure algorithm. It was shown that the use of homophonic substitution increases the security of the ciphertext and that breaking HSPC2 (homophonic substitution prefix codes with 2 homophones) is an NP-complete problem.