DocumentCode
3421796
Title
Crypto-compression prefix coding
Author
Milidiu, Ruy L. ; Mello, Claudio G.
Author_Institution
Dept. of Inf., RUC-Rio, Rio de Janeiro
fYear
2006
fDate
28-30 March 2006
Lastpage
461
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference, 2006. DCC 2006. Proceedings
Conference_Location
Snowbird, UT
ISSN
1068-0314
Print_ISBN
0-7695-2545-8
Type
conf
DOI
10.1109/DCC.2006.17
Filename
1607304
Link To Document