Advertisement

Simple Substitution Ciphers

  • Andrea Sgarro
Part of the International Centre for Mechanical Sciences book series (CISM, volume 279)

Abstract

Substitution ciphers are a rather unsophisticated and time-honoured class of ciphers, to the extent that one may feel that they appeal to aesthetical-minded mathematicians rather than to communications engineers or to computer scientists. However, one should not overlook the fact that individually weak ciphers can be combined into a network to give a hopefully strong cryptographic system: an obvious example here is the Data Encryption Standard, or DES, developed by IBM, which is built up by concatenating substitution and transposition ciphers.

Keywords

Error Probability Exponential Term Conditional Entropy Composition Class Data Encryption Standard 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    C. Shannon, “Communication theory of secrecy systems”, Bell Syst. Tech. J., vol. 28, pp. 656–715, Oct. 1949.MathSciNetMATHGoogle Scholar
  2. [2]
    R.J. Blom, “Bounds on key equivocation for simple substitution ciphers”, IEEE Trans. Inform. Theory, vol. IT-25, pp. 8–18, Jan. 1979.Google Scholar
  3. [3]
    J.G. Dunham, “Bounds on message equivocation for simple substitution ciphers”, IEEE Trans. Inform. Theory, vol. IT-26, pp. 522–527, Sept. 1980.Google Scholar
  4. [4]
    A. Sgarro, “Error probabilities for simple substitution ciphers” IEEE Trans. Inform. Theory, vol. IT-29, March 1983.Google Scholar
  5. [5]
    I. Csiszâr and J. Körner “Information theory: coding theorems for discrete memoryless systems”, New York, Academic, 1981.MATHGoogle Scholar

Copyright information

© Springer-Verlag Wien 1983

Authors and Affiliations

  • Andrea Sgarro
    • 1
  1. 1.Università di TriesteItaly

Personalised recommendations