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?
Given,
Linear congruential generator used is ( aXi + b ) ( mod 11 )
So,
Xi+1 = ( aXi + b ) ( mod 11 )
Multiplier is a.
Seed element is X0.
b is increment.
The modulus is 11,
With modulus 11, the value of XI+1 ranges from 0 to 11.
The 3 numbers which are seen in a row are 3, 5, 0.
Let,
3 = ( aXr + b ) ( mod 11 )------------------ eq 1
The next number is 5.
So,
5 = (3a+b) ( mod 11 ) ------------------ eq 2
The next number is 0.
0 = (5a+b) ( mod 11 ) -------------------- eq 3
Subtract eq3 from eq 2,
5-0 = ( 3a + b ) ( mod 11 ) - (5a+b) ( mod 11 )
5 = (-2 * a) ( mod 11 )
= ( 9 * a ) ( mod 11 ) since 11 - 2 is 9.
So,
we get :
5 = 9a ( mod 11 )
Multiplicative inverse of 9 with respect to mod 11 is 5.
5*5 = a ( mod 11 )
25 mod 11 = a
a = 3
Put the value of a in eq 2 :
5 = (9+b) ( mod 11 )
5 mod 11 = 9 + b
5 = 9 + b
b = -4
So, the values are a = 3 and b = -4.
Alice is using a linear congruential generator, axi + b mod 11, to generate pseudo-random numbers....
Generate 10 random numbers using the following linear congruential generator with 7 as the seed: si+1 = (5 * si + 1) mod 20.
a) b) Consider the linear congruential generator Xi41 = (5X; 1)mod(8). Using Xo 0, calculate the 99th pseudo-random number Ug9 16807 X-1 mod(231 - 1). Using Consider our "desert island" PRN generator, X; Xo 12345678, calculate X99. Consider the linear congruential generator Xi41 = (5X; 1)mod(8). Using Xo 0, calculate the 99th pseudo-random number Ug9 16807 X-1 mod(231 - 1). Using Consider our "desert island" PRN generator, X; Xo 12345678, calculate X99.
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...
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
Use linear congruential generator with seed value 31, a = 11, c = 17, m = 100 and inverse transform technique to generate: 10 continuous uniform random variates on interval [1; 10]; [5] 10 exponential random variates with parameter λ = 3. [2] It is suspected that the generated random numbers (Ri) are autocorrelated, since an observer notices that every 4th number starting (but not counting) from the 1st number (i.e. i = 1) is larger...
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)
9. Use the construction in the proof of the Chinese remainder theorem to find a solution to the system of congruences X 1 mod 2 x 2 mod 3 x 3 mod 5 x 4 mod 11 10. Use Fermats little theorem to find 712 mod 13 11. What sequence of pseudorandom numbers is generated using the linear congruential generator Xn+1 (4xn + 1) mod 7 with seed xo 3? 9. Use the construction in the proof of the Chinese...
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...
3. Generate random numbers as indicated and comment on the results. (a) generate 10 random numbers using the middle-square method using 20 = 1009. (b) generate 10 random numbers using linear congruence with a = 5, b = 1 and c= 8.
3. Generate random numbers as indicated and comment on the results. (a) generate 10 random numbers using the middle-square method using zo = 1009. (b) generate 10 random numbers using linear congruence with a = 5,b=1 and c= 8.