Abstract

THE problems of cryptography and secrecy systems furnish an interesting application of communication theory. <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup> In this paper a theory of secrecy systems is developed. The approach is on a theoretical level and is intended to complement the treatment found in standard works on cryptography. <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> There, a detailed study is made of the many standard types of codes and ciphers, and of the ways of breaking them. We will be more concerned with the general mathematical structure and properties of secrecy systems.

Keywords

SecrecyCryptographyComplement (music)Computer scienceTheoretical computer scienceInformation-theoretic securityAlgorithmComputer securityBiology

Related Publications

Low-density parity-check codes

A low-density parity-check code is a code specified by a parity-check matrix with the following properties: each column contains a small fixed number <tex xmlns:mml="http://www....

1962 IEEE Transactions on Information Theory 10397 citations

Compressed sensing

Suppose x is an unknown vector in Ropf <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sup> (a digital image or signal); we pla...

2006 IEEE Transactions on Information Theory 22524 citations

Publication Info

Year
1949
Type
article
Volume
28
Issue
4
Pages
656-715
Citations
9088
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

9088
OpenAlex

Cite This

Claude E. Shannon (1949). Communication Theory of Secrecy Systems*. Bell System Technical Journal , 28 (4) , 656-715. https://doi.org/10.1002/j.1538-7305.1949.tb00928.x

Identifiers

DOI
10.1002/j.1538-7305.1949.tb00928.x