Abstract
In a substitution cipher, each letter in the plaintext is replaced by another letter. In a transposition cipher, the entire plaintext is replaced by a permutation of itself. If the plaintext is long, then each sentence is replaced by a permutation of itself. The number of permutations of n objects is n!, a number that grows much faster than n. However, the permutation being used has to be chosen such that the receiver will be able to decipher the message. [Barker 92] describes a single-column transposition cipher.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Salomon, D. (2003). Transposition Ciphers. In: Data Privacy and Security. Springer, New York, NY. https://doi.org/10.1007/978-0-387-21707-9_3
Download citation
DOI: https://doi.org/10.1007/978-0-387-21707-9_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-1816-1
Online ISBN: 978-0-387-21707-9
eBook Packages: Springer Book Archive