Name
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. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1002/ett.4460050405 | European Transactions on Telecommunications |
Keywords | Field | DocType |
huffman codes,source code,data compression,stream cipher | Modified Huffman coding,Tunstall coding,Context-adaptive variable-length coding,Computer science,Theoretical computer science,Huffman coding,Shannon–Fano coding,Arithmetic coding,Context-adaptive binary arithmetic coding,Variable-length code | Journal |
Volume | Issue | Citations |
5 | 4 | 7 |
PageRank | References | Authors |
0.56 | 8 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| James L. Massey | 1 | 1096 | 272.94 |