Problem 16
Using the RSA encryption algorithm, pick \(p=11\) and \(q=7\). Find a set of encryption/ decryption keys e and \(d\).
Problem 18
If a message is encrypted using AES with a key length of 256 bits, the brute force approach to decryption involves generating each of the \(2^{256}\) possible keys in turn until one is found that decodes the encrypted message. Quantum computing was discussed in Chapter 5. Using a quantum computer, how many qubits are required to represent all \(2^{256}\) possible keys simultaneously?
