Some applications of source coding in cryptography
Author:
- 1 July 1994
- journal article
- research article
- Published by Wiley in European Transactions on Telecommunications
- Vol. 5 (4) , 421-430
Abstract
It is shown that the techniques of source coding (or “data compression”) can be usefully applied in cryptography. Five source coding schemes (Shannon‐Fano coding, Huffman coding, Lynch‐Davisson coding, Elias‐Willems coding, and Lempel‐Ziv coding) are reviewed and their characteristics delineated. It is then shown how the last three of these schemes, which are of the universal source coding type, can be advantageously used to create strongly‐ideal ciphers, to perform “universal” homophonic substitution, to test random bit generators, and to strengthen running‐key generators for stream ciphers.Keywords
This publication has 12 references indexed in Scilit:
- A universal statistical test for random bit generatorsJournal of Cryptology, 1992
- Universal data compression and repetition timesIEEE Transactions on Information Theory, 1989
- Interval and recency rank source coding: Two on-line adaptive variable-length schemesIEEE Transactions on Information Theory, 1987
- An Information-Theoretic Approach to Algorithms1985
- A Technique for High-Performance Data CompressionComputer, 1984
- A universal algorithm for sequential data compressionIEEE Transactions on Information Theory, 1977
- Universal codeword sets and representations of the integersIEEE Transactions on Information Theory, 1975
- Sequence time coding for data compressionProceedings of the IEEE, 1966
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952
- Communication Theory of Secrecy Systems*Bell System Technical Journal, 1949