Combinatorics

Andreas Klein
Additional contact information
Andreas Klein: State University of Ghent, Dept. of Pure Mathem. & Computer Algebra

Chapter Chapter 16 in Stream Ciphers, 2013, pp 329-335 from Springer

Abstract: 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.

Keywords: Enumerative Combinatorics; Bernoulli Numbers; Permutation; Counting Problem; Finite Tree (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4471-5079-4_16

Ordering information: This item can be ordered from
http://www.springer.com/9781447150794

DOI: 10.1007/978-1-4471-5079-4_16

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().