Learn More
We have derived a lower bound on the linear span of a binary sequence generated by a Feedback with Carry Shift Register (FCSR) under the following condition: is a power of a prime such that = ( 2) and (= 2 + 1) where both and are 2-prime. This allows us to design FCSR stream ciphers similar to previously proposed Linear Feedback Shift Register (LFSR) stream(More)
Random mappings, forests, and subsets associated with Abel-Cayley-Hurwitz multinomial expansions. (English summary) A mapping f from the set {1,. .. , n} to itself is called a random mapping if all n n such mappings are equally likely. Such mappings occur naturally in many problems in discrete probability such as hashing, coupon collection, the birthday(More)
  • 1