Huffman codes and Lempel-Ziv-Welsh are both compression algorithms that rely on assigning often repeated symbols and patterns shorter codes and rarer symbols and patterns longer codes. True False 3 Question 6 1 pts ElGamal public-key encryption relies on the computational difficulty factoring the product of two large prime numbers. True False Question 7 1 pts An 256 bit ECC key will have greater key strength than a 256 bit AES key True False