This process is less vulnerable to state compromise extension when it is backtracking-resistant. The so-called “HILL” paper by Håstad, Impagliazzo, Levin, and Luby showed that an algorithm for this process can be constructed from any one-way function. The quadratic residuosity problem is the basis of the security of an algorithm for this process that requires both inputs to be congruent to 3 mod 4. (-5[1])Cryptographically (-5[1])secure algorithms for this process (-5[1])are used to create initialization (10[1])vectors and nonces, and such algorithms for it must pass the next bit test. (10[3])A simple algorithm for this process repeatedly performs xorshifts (10[2]-5[1])(“X-or-shifts”). The (-5[1])Mersenne (“mair-SEN”) Twister (10[2])and other (10[2])algorithms (10[2])for this process (10[2])are initialized (10[2])with a seed. For (10[1])10 points, name this (10[1])process that creates a sequence whose next value cannot be predicted. ■END■ (10[3]0[1])