Problem 4: Attacking elliptic Diffie-Hellman Grading criteria: code correctness for a and b; mathematical correctness for c. 4a. Let E be the elliptic curve from the previous problem. Factor the order of E. In [ ]: 4b. Adapt the CRT code presented in lecture to attack the discrete logarithm problem for E. Use the code given below to test your work. In [ ]: def elliptic_crt(h): # your code goes here In [ ]: ## Use this to test your code m = randint(0, p-1) h = m*g print(m) print(g.discrete_log(h)) print(elliptic_crt(h)) In : c. Describe, either in words or in code, a method for finding an elliptic curve of a similar size for which the CRT method is not effective. (There are a few possible valid answers.) In [ ]: Problem 4: Attacking elliptic Diffie-Hellman Grading criteria: code correctness for a and b; mathematical correctness for c. 4a. Let E be the elliptic curve from the previous problem. Factor the order of E. In [ ]: 4b. Adapt the CRT code presented in lecture to attack the discrete logarithm problem for E. Use the code given below to test your work. In [ ]: def elliptic_crt(h): # your code goes here In [ ]: ## Use this to test your code m = randint(0, p-1) h = m*g print(m) print(g.discrete_log(h)) print(elliptic_crt(h)) In : c. Describe, either in words or in code, a method for finding an elliptic curve of a similar size for which the CRT method is not effective. (There are a few possible valid answers.) In [ ]