Title :
Crypto-compression prefix coding
Author :
Milidiu, Ruy L. ; Mello, Claudio G.
Author_Institution :
Dept. of Inf., RUC-Rio, Rio de Janeiro
Abstract :
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
Keywords :
computational complexity; cryptography; data compression; encoding; optimisation; NP-complete problem; ciphertext; cryptocompression prefix coding; data cipher; data compression algorithms; homophonic substitution prefix codes with 2 homophones; Costs; Cryptography; Data compression; Data engineering; Huffman coding; Informatics; Information retrieval; Information security; Military computing; NP-complete problem;
Conference_Titel :
Data Compression Conference, 2006. DCC 2006. Proceedings
Conference_Location :
Snowbird, UT
Print_ISBN :
0-7695-2545-8
DOI :
10.1109/DCC.2006.17
