A new encoding decoding scheme for text compression with embedded security
Summary: 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.
- The variable-interval arithmetic coding using asymptotic deterministic randomness for data compression and encryption
- Integrated encryption in dynamic arithmetic compression
- scientific article; zbMATH DE number 1487949
- scientific article; zbMATH DE number 67079
- Integrated encryption in dynamic arithmetic compression
This page was built for publication: A new encoding decoding scheme for text compression with embedded security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583486)
