Abstract
It was recognised by Shannon that data compression increases the strength of secrecy systems when applied prior to encryption. Compression techniques have advanced considerably in recent years. This paper considers the extent to which these techniques can increase security. Estimates are obtained for how far practical compression schemes can increase unicity distance of symmetric ciphers. It is noted that there are other good reasons for using data compression prior to encryption. Comparison is made with homophonic coding and it is suggested that data compression is more worthwhile for practical sources such as natural language.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
T. Bell, I.H. Witten and J.G. Cleary, Modeling for Text Compression, ACM Computing Surveys, 21,4, December 1989.
G.V. Cormack and R.N.S. Horspool, Data Compression using Dynamic Markov Modelling, The Computer Journal, 30,6, 1987.
P. Grassberger, Estimating the Information Content of Symbol Sequences and Efficient Codes, IEEE Transactions on Information Theory, IT-35,3, pp 669–675, 1989.
C.G. Günther, A Universal Algorithm for Homophonic Coding, Proceedings of Eurocrypt 88, Springer-Verlag, 1988.
D.A. Huffman, A method for the Construction of Minimum-Redundancy Codes, Proceedings of the IERE, 40,9, 1952.
H.N. Jendal, Y.J.B. Kuhn and J.L. Massey, An Information-Theoretic Treatment of Homophonic Substitution, Proceedings of Eurocrypt 89, Springer-Verlag, 1990.
G.G. Langdon, An Introduction to Arithmetic Coding, IBM Journal of Research and Development, 28,2, 1984.
D.A. Lelewer and D.S. Hirschberg, Data Compression, ACM Computing Surveys, 13,3, 1987.
R. Phillips and S. Jones, A 100 MBit/s Adaptive Compressor Chip, Abstracts of Second Bangor Symposium on Communications, May 1990.
J. Rissanen and G.G. Langdon, Universal Modelling and Coding, IEEE Transactions on Information Theory, IT-27,1, pp 12–23, 1981.
C.E. Shannon, Communication Theory of Secrecy Systems, Bell Systems Technical Journal, 656–715, 1949.
C.E. Shannon and W. Weaver, The Mathematical Theory of Communication, University of Illinois Press, 1949.
M. Smid and D. Branstad, The Data Encryption Standard: Past and Future, Proceedings of the IEEE, 76,5, 1988.
H.C.A. van Tilborg, An Introduction to Cryptology, Kluwer Academic Publishers, 1988.
D. Welsh, Codes and Cryptography, Clarendon Press, Oxford, 1988.
I.H. Witten and J.G. Cleary, On the Privacy Afforded by Adaptive Text Compression, Computers and Security, 7, 1988, pp397–408.
I.H. Witten, R. Neal and J.G. Cleary, Arithmetic Coding for Data Compression, Communications of the ACM, 30,6, 1987.
J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Transactions on Information Theory, IT-23,3, pp 337–343, 1977.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boyd, C. (1991). Enhancing Secrecy by Data Compression: Theoretical and Practical Aspects. In: Davies, D.W. (eds) Advances in Cryptology — EUROCRYPT ’91. EUROCRYPT 1991. Lecture Notes in Computer Science, vol 547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46416-6_23
Download citation
DOI: https://doi.org/10.1007/3-540-46416-6_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54620-7
Online ISBN: 978-3-540-46416-7
eBook Packages: Springer Book Archive