Problem
I. If an adversary knows the process by which a 128-bit key was generated, and this process generates keys with only 73 bits of entropy, with what probability can the adversary potentially guess the key (in a single guess)?
II. What is the name of the pseudorandom number generation algorithm used in the random module of the Python standard library? Is this a cryptographically secure PRNG?
III. The Fortuna RNG described in your textbook has been implemented in the Linux operating system. Use the description of its implementation at jlcooke ca random to answer the following.
i. Which hash function does it use to extract entropy from input events?
ii. Which block cipher and mode of operation does it use to generate the pseudorandom output?