a)
b)
a) b) Consider the linear congruential generator Xi41 = (5X; 1)mod(8). Using Xo 0, calculate the...
Alice is using a linear congruential generator, axi + b mod 11, to generate pseudo-random numbers. Eve sees three numbers in a row, 3, 5, 0, that are generated from Alice’s function. What are the values of a and b?
generator: Generate 100,000 Unif(0,1) pseudo-random numbers from the “desert island” 16807 generator. How many runs up and down did you observe? X; = 16807X;- mod(231-1)
A) What sequence (At least 8 sequences) of pseudorandom numbers is generated using the linear congruential generator xn+1 (3xn2) mod 13 with seed Xo- 1? B)Find the sequence of pseudorandom numbers generated by the power generator with p-7, d-3, and seed xo 2
What is the period-length of the Linear Congruential Generator Xn+1 = (2Xn + 5)mod13 with seed Xo = 8? Numeric Answer: ! Cannot be empty What is the period-length of the Linear Congruential Generator Xn+1 = (2Xn + 5)mod13 with seed Xo = 1? Numeric Answer: 1 O Cannot be empty Linear Congruential Generator: Example 2 Homework • Unanswered What is the period-length of the Linear Congruential Generator Xn+1 = (1Xn + 5)mod13 with seed Xo = 1? Numeric Answer:...
11. What sequence of pseudorandom numbers is generated using the linear congruential generator xn +1 (4xn + 1) mod 7 with seed Xo-37 12. Encrypt the message STOP POLLUTION by translating the letters into numbers, applying the encryption function/ P)-(p + 4) mod 26, and then translating the numbers back into letters. 13. Decrypt this message encrypted using the shift cipher f (p) (p+ 10) mod 26 CEBBOXNOBXYG 14. Let P() be the statement that 12 +22 ++n2 -n-)(en+2) for...
Generate 10 random numbers using the following linear congruential generator with 7 as the seed: si+1 = (5 * si + 1) mod 20.
Problem 8 (Pseudorandom Numbers). Randomly chosen numbers are often needed for computer simulations of physical phenomena, and they are needed to generate random keys for cryptography. Different methods have been devised for generating numbers that have certain properties of randomly chosen numbers. Because numbers generated by systematic methods are not truly random, they are called pseudorandom numbers. There are fundamental properties we would like the pseudorandom sequence/pseudorandom number generator to possess for cryptographic purposes. 1. It is easy to compute...
1. (30 points) Consider the systematic binary linear (6,3) code with generator matrix 1 0 01 1 0 G- 0 1 0 0 1 1 a) Determine the parity check matrix H of the code. b) What is the minimum distance of the code? How many errors can this code correct and detect? c) Show the results in b) using decoding table d) Find the most likely codeword, given that the noisy received codeword is 010101. e) Now suppose 001101...
5. Hashing (a) Consider a hash table with separate chaining of size M = 5 and the hash function h(x) = x mod 5. i. (1) Pick 8 random numbers in the range of 10 to 99 and write the numbers in the picked sequence. Marks will only be given for proper random numbers (e.g., 11, 12, 13, 14 ... or 10, 20, 30, 40, .. are not acceptable random sequences). ii. (2) Draw a sketch of the hash table...
Consider the random variable X with probability density f(x)={(x^3)/2 for 0<x<8^(1/4), 0 elsewhere} Find the probability density of Y=(1/5)ln(X+4)using transformation techniques.