By Topic

Experiments on a secure compression algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Celikel, E. ; Int. Comput. Inst., Ege Univ., Izmir, Turkey ; Dalkilic, M.E.

A compression tool can provide security to some degree, if the algorithm itself is kept secret. Whenever the algorithm is known, as is the case for conventional compression, we cannot expect secrecy out of the tool. If security is needed as well, compression can be combined with encryption. To employ a system that would afford security while compressing, a novel technique (named as secure compression -SeCom) has been designed and implemented. We present the experimental results obtained by applying this scheme on texts from English and Turkish corpora. The results are promising in terms of compression quality and throughput, measured in bpc and MB/min, respectively.

Published in:

Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004. International Conference on  (Volume:2 )

Date of Conference:

5-7 April 2004