Abstract
We will now move away from public-key cryptography in the remaining chapters. Most of the mathematics used so far has been number theory and abstract algebra. But now we will see that probability is also useful in cryptanalysis. In particular, we will see a method for breaking substitution ciphers that is fully automated. It won’t necessarily solve the cipher fully, but it will tend to get sufficiently close that fixing it at the end by hand will be very easy.
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
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Rubinstein-Salzedo, S. (2018). Markov Chains. In: Cryptography. Springer Undergraduate Mathematics Series. Springer, Cham. https://doi.org/10.1007/978-3-319-94818-8_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-94818-8_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-94817-1
Online ISBN: 978-3-319-94818-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)