Write a program to generate and print mnemonic words from a given random sequence of bits.

1. Create a random sequence (entropy) of 128/160/192/224/256 bits.
2. Compute the SHA256 hash of the random sequence. Take the first (entropy-length/32) bits of its hash as the checksum.
3. Concatenate the random sequence and the checksum.
4. Divide the result into sections of 11 bits.
5. Map each 11-bit value to a word from the predefined dictionary of 2048 words.
6. Print the mnemonic words in the correct order.

Table 5-1: Checksum bits and number of mnemonic words depend on length of entropy.

Get the dictionary/wordlist from BIP-39. There's a section that describes the characteristics of an ideal wordlist, and a separate section that links to the actual wordlists.

Password-Based Key Derivation Function 2 (PBKDF2) is a key derivation function to make brute force attacks more difficult with key stretching.

    DK = PBKDF2(PRF, Password, Salt, c, dkLen)

Given the following parameters, use a PBKDF2 library to derive a key:

• c (number of rounds): 4096
• PRF (pseudorandom function): HMAC-SHA256
• dkLen (derived key length): 256

The PBKDF2 key derivation function takes two more parameters: a password, and a salt. For this exercise, you can choose arbitrary values for these two.