RC4 has a secret internal state which is a permutation of all the possible values of the vector S and the two indices i and j a. Using a straightforward scheme to store the internal state, how many bits are used? b. Suppose we think of it from the point of view of how much information is represented by the state. In that case, we need to determine how may different states there are, then take the log to the base 2 to find out how many bits of information this represents. Using this approach, how many bits would be needed to represent the state?

RC4 has a secret internal state which is a permutation of all the possible values of the vector S and the two indices i and j a. Using a straightforward scheme to store the internal state, how many bits are used? b. Suppose we think of it from the point of view of how much information is represented by the state. In that case, we need to determine how may different states there are, then take the log to the base 2 to find out how many bits of information this represents. Using this approach, how many bits would be needed to represent the state?

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter17: Markov Chains

Section17.4: Classification Of States In A Markov Chain

Problem 3P

See similar textbooks

Similar questions

I actually forgot to type "xw" after "given by" in my question. Consider a text corpus consisting of N tokens of d distinct words and the number of times each distinct word w appears is given by xw.
we represent the finite-length signals as vectors in Euclidean space, many operations on signals can be encoded as a matrix-vector multiplication. Consider for example a circular shift in C: a delay by one (i.e. a right shift) transforms the signal x = (xo X1 X2]" into x = [xı xo xz]" and it can be described by the matrix TO D = [0 1 0'0 0 1'1 0 0] so that x = Dx. Determine the matrix F that implements the one step difference operator in C ie the operator that transforms a signal x into [(x - x)(x1 - x0)(x2 - 1)]
Let C be a linear [n, k]-code with alphabet GF(q). Let C+ be any code obtained from C by lengthening, that is, first adding one extra bit to every codeword of C and then adding one extra row to a generating matrix for C while maintaining linear independence. (a) Find the length and dimension of C+. (b) Suppose C is perfect and 1-error-correcting. Prove C+ cannot be 1-errorcorrecting.
Suppose you’re consulting for a bank that’s concerned about fraud detection, and they come to youwith the following problem. They have a collection of n bank cards that they’ve confiscated, suspectingthem of being used in fraud. Each bank card is a small plastic object, containing a magnetic stripe withsome encrypted data, and it corresponds to a unique account in the bank. Each account can have manybank cards corresponding to it, and we’ll say that two bank cards are equivalent if they correspond to thesame account.It’s very difficult to read the account number off a bank card directly, but the bank has a high-tech “equivalence tester” that takes two bank cards and, after performing some computations, determines whether theyare equivalent.Their question is the following: among the collection of n cards, is there a set of more than n/2 of themthat are all equivalent to one another? Assume that the only feasible operations you can do with the cardsare to pick two of them and plug them…
Exercise: "Let the messages consist of all strings of length 2 over GF(3). Encode the message ab to abc where c = a + 2b( mod 3)." How can I find the generator matrix of this?
Exercise 13 Name: 11.5 (Multiplicative ElGamal). Let G be a cyclic group of prime order q generated by g € G. Consider a simple variant of the ElGamal encryption system EMEG = (G. E, D) that is defined over (G. G²). The key generation algorithm G is the same as in EEG, but encryption and decryption work as follows: ⚫ for a given public key pku G and message mЄ G: E(pk, m) := eum, output (v, e) ⚫ for a given secret key sk= a € Zq and a ciphertext (v,e) € G²: D(sk, (v, e)) e/v Show that EMEG has the following property: given a public key pk, and two ciphertexts C1E(pk, m) and c2 E(pk, m2), it is possible to create a new ciphertext e which is an encryption of m₁ m2. This property is called a multiplicative homomorphism.
What is the encoding of the data sample [1.4,2]^T that is obtained using the spanning vector c=[1.8,1.7]^T? Write the answer with 2 decimal places. Give me solution detaily
To have random-access lookup, a grid should have a scheme for numbering the tiles.For example, a square grid has rows and columns, which give a natural numberingfor the tiles. Devise schemes for triangular and hexagonal grids. Use the numberingscheme to define a rule for determining the neighbourhood (i.e. adjacent tiles) of agiven tile in the grid. For example, if we have a four-connected square grid, wherethe indices are i for rows and j for columns, the neighbourhood of tile i, j can bedefined asneighbourhood(i, j) = {i ± 1, j,i, j ± 1}
Please written by computer source Given two strings x1…xn, y1…ym find the length of their longest common subsequence, that is, the largest k for which there exist indices i1<…<ik and j1<=<jk such that xi1…xik…=yj1=yjk. Show how to do this in time O(nm) and find its space complexity.
It is said that the set of pages in memory for n frames is always a subset of the set of pages in memory for n + 1 frames if the same series of accesses are made in the same order as before. Demonstrate LRU and OPT (recently) construct a hierarchy of algorithms.
Let R=ABCDEGHK and F= {ABK→C, A→DG, B→K, K→ADH, H→GE} . Is it in BCNF? Prove your answer.
Show that the relation R consisting of all pairs (x, y) suchthat x and y are bit strings of length three or more thatagree except perhaps in their first three bits is an equivalence relation on the set of all bit strings of length threeor more.