Journals / Mathematical and Computational Applications / 2004 / Cilt: 9 - Sayı: 3

A new encoding decoding scheme for text compression with embedded security

Pages
475–484
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

The results obtained are encouraging in terms of both compression and security.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In today's communication world, finding out and improving the means of better channel utilization, as well as providing the security of data transmitted are the key issues.
📊
Key Findings & Data:While standard compression tools (e.g. gzip of Unix and pkzip of Windows platforms) achieve compression rates at around 3 bpc (bits per character) for text type of data, they are poor at security.
💡
Conclusion & Impact:The results obtained are encouraging in terms of both compression and security.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

In today's communication world, finding out and improving the means of better channel utilization, as well as providing the security of data transmitted are the key issues. For some data types, e.g. text, full (lossless) data recovery might also be required. Therefore, a lossless compression algorithm that is reasonably fast and secure enough would meet the needs of many in the networking environments. While standard compression tools (e.g. gzip of Unix and pkzip of Windows platforms) achieve compression rates at around 3 bpc (bits per character) for text type of data, they are poor at security. This study presents the design and implementation of a new encoding/ decoding scheme to offer compression and security at the same time. For that, the scheme combines compression with encryption. To address the security issue, encoding is made through an Encoding matrix generated by a Pseudo Random Number Generator. This encoding already provides an initial compression. It then uses Arithmetic Coding to further compress the text. For further security, an iterative encoding scheme is proposed and implemented. The results obtained are encouraging in terms of both compression and security.

🔖

Cite This Article

ÇELİKEL, E., DALKILIÇ, E. (2004). A new encoding decoding scheme for text compression with embedded security. Mathematical and Computational Applications, Cilt: 9 - Sayı: 3, 475–484. https://ajindex.com/articles/280072

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (2)

  1. M. Nelson, The Data Compression Book, M&T Publishing, New York, USA, 1996. 2.I. Witten, A. Moffat and T. C. Bell, Managing Gigabytes - Compressing and Indexing Documents and Images, San Fransisco, CA, USA, 1999. 3.W. Stallings, Network&Internetwork Security, Prentice Hall, New Jersey, USA, 1995. 4.A. Menezes et. al, Handbook of Cryptography, CRC Press, USA, 1997. 5.GAP Manual, http://www.gap-system.org. 6.Calgary Corpus, ftp://ftp.cpsc.ucalgary.ca/pub/projects/text.compression.corpus. 7.GZIP Manual, http://www.gzip.org/#intro 8.D. Hankerson, G.A. Harris and P.D.Jr. Johnson, Introduction to Information Theory and Data Compression, CRC Press,
  2. FL, USA, 1998. 9.J. Ziv and A. Lempel, A Universal Algorithm for Sequential Data Compression, IEEE Transactions on Information Theory, Vol. 23, No. 3, pp. 337-343, 1977. 10.M. E. Dalkilic and E. Celikel, Concept of and Experiments on Combining Compression with Encryption, ISCIS XVII, Orlando, USA, 2002. 11.PPM*, http://ftp.cs.waikato.ac.nz/pub/compression.ppm 12.BWMN, http://www.dogma.net/markn/articles/bwt/bwt.htm