Related Concepts
Definition
This is an encryption operating on groups of five-bit words, by means of coordinate-wise addition modulo 2 (Modular Arithmetic). Normally, the CCIT2-code is used. The key should be a completely random, one-time key (Key).
The Vernam table (Table 1) for \({\textrm{ Z}}_{32} ={{ \textrm{ Z}}_{2}}^{5}\) (Gilbert S. Vernam, 1917) looks like:
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsRecommended Reading
Bauer FL (1997) Decrypted secrets. In: Methods and maxims of cryptology. Springer, Berlin
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this entry
Cite this entry
Bauer, F.L. (2011). Vernam Cipher. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_177
Download citation
DOI: https://doi.org/10.1007/978-1-4419-5906-5_177
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5905-8
Online ISBN: 978-1-4419-5906-5
eBook Packages: Computer ScienceReference Module Computer Science and Engineering