Enhancing secrecy by data compression: theoretical and practical aspects

Authors:
Colin Boyd
Affiliations:
Communications Research Group Electrical Engineering Laboratories, University of Manchester, Manchester, UK
Venue:
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Year:
1991

Citing 10
Cited 0

Data compression using dynamic Markov modelling

The Computer Journal
Data compression

ACM Computing Surveys (CSUR)
Codes and cryptography

Codes and cryptography
On the privacy afforded by adaptive text compression

Computers and Security
A universal algorithm for homophonic coding

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Modeling for text compression

ACM Computing Surveys (CSUR)
An information-theoretic treatment of homophonic substitution

EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Arithmetic coding for data compression

Communications of the ACM
A Mathematical Theory of Communication

A Mathematical Theory of Communication
An introduction to arithmetic coding

IBM Journal of Research and Development

Quantified Score

Hi-index	0.00

Visualization

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.