Question 11 1 pts In RSA public key encryption, let p and q be large prime numbers, let N=pq, phi = (p-1)q-1), and e be some number that is relatively prime to phi. Which numbers need to be kept private? Select all that apply. p and a phi N De Question 12 1 pts Non-cryptographic hashing algorithms are designed for speed and only need to avoid one potential issue that cryptographic hashing algorithms have to worry about. Which issue is that? Collisions Brute force attacks Rainbow table attacks Man-in-the-middle attacks