Abstract
Enumerative Combinatorics is of course an important part of cryptography. We use it extensively when analysing RC4. Here are the proofs for some combinatorial results which we used.
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
References
Cayley, A.: A theorem on trees. Q. J. Math. 23, 376–378 (1889)
Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics, 2nd edn. Addison-Wesley, Reading (1994)
Knuth, D.E.: The Art of Computer Programming, vol. 1. Fundamental Algorithms, 3rd edn. Addison-Wesley, Reading (1998)
Knuth, D.E.: The Art of Computer Programming, vol. 3. Sorting and Searching, 3rd edn. Addison-Wesley, Reading (1998)
Prüfer, H.: Neuer Beweis eines Satzes über Permutationen. Arch. Math. Phys. 27, 742–744 (1918)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this chapter
Cite this chapter
Klein, A. (2013). Combinatorics. In: Stream Ciphers. Springer, London. https://doi.org/10.1007/978-1-4471-5079-4_16
Download citation
DOI: https://doi.org/10.1007/978-1-4471-5079-4_16
Publisher Name: Springer, London
Print ISBN: 978-1-4471-5078-7
Online ISBN: 978-1-4471-5079-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)