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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Shannon, “Communication theory of secrecy systems”, Bell Syst. Tech. J., vol. 28, pp. 656–715, Oct. 1949.
R.J. Blom, “Bounds on key equivocation for simple substitution ciphers”, IEEE Trans. Inform. Theory, vol. IT-25, pp. 8–18, Jan. 1979.
J.G. Dunham, “Bounds on message equivocation for simple substitution ciphers”, IEEE Trans. Inform. Theory, vol. IT-26, pp. 522–527, Sept. 1980.
A. Sgarro, “Error probabilities for simple substitution ciphers” IEEE Trans. Inform. Theory, vol. IT-29, March 1983.
I. Csiszâr and J. Körner “Information theory: coding theorems for discrete memoryless systems”, New York, Academic, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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