Abstract
The classical situation in cryptology, which we will consider below, is the following: There are two parties, A (called “Alice” in the jargon) and B (called “Bob”). Alice would like to send a message to Bob by some channel. But this channel is unsecure because in-between the two, there is some adversary (“enemy”, eavesdropper) E (called “Eve”) who either wants
-
to listen in on the message sent from A to B and/or
-
to send a message herself to B, asserting that this message comes from A and/or
-
to change a message indeed sent by A to B.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Neuenschwander, D. (2004). 1 Classical Polyalphabetic Substitution Ciphers. In: Probabilistic and Statistical Methods in Cryptology. Lecture Notes in Computer Science, vol 3028. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25942-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-25942-8_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22001-5
Online ISBN: 978-3-540-25942-8
eBook Packages: Springer Book Archive