Skip to main content

Simple Substitution Ciphers

  • Chapter
Secure Digital Communications

Part of the book series: International Centre for Mechanical Sciences ((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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Shannon, “Communication theory of secrecy systems”, Bell Syst. Tech. J., vol. 28, pp. 656–715, Oct. 1949.

    MathSciNet  MATH  Google Scholar 

  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. 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. A. Sgarro, “Error probabilities for simple substitution ciphers” IEEE Trans. Inform. Theory, vol. IT-29, March 1983.

    Google Scholar 

  5. I. Csiszâr and J. Körner “Information theory: coding theorems for discrete memoryless systems”, New York, Academic, 1981.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Wien

About this chapter

Cite this chapter

Sgarro, A. (1983). Simple Substitution Ciphers. In: Longo, G. (eds) Secure Digital Communications. International Centre for Mechanical Sciences, vol 279. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2640-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-2640-0_2

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-81784-1

  • Online ISBN: 978-3-7091-2640-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics