Abstract
Monoalphabetic encryption uses some encryption step (possibly a polygraphs one) over and over. All the encryption steps treated in Chapters 3–6 can be used monoalphabetically—this was tacitly assumed in the examples. Genuine polyalphabetic encryption requires that the set M of available encryption steps has at least two elements, i.e., that the cryptoSystem M has at least the cardinality θ = 2. For the frequent case θ = N , where N = |V|, the French literature speaks of a chiffre carré.
This is a preview of subscription content, log in via an institution to check access.
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
Marquis Gaëtan Henri Läon de Viaris, 1847–1901, French cryptologist. De Viaris invented in about 1885 one of the first printing cipher machines—according to Kahn, the very first were invented presumably before 1874 by Émile Vinay and Joseph Gaussin.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bauer, F.L. (2000). Polyalphabetic Encryption: Families of Alphabets. In: Decrypted Secrets. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04024-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-04024-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-04026-3
Online ISBN: 978-3-662-04024-9
eBook Packages: Springer Book Archive