p =101, q = 137, e = 4213  

1. (10 points) On Canvas, you will find in your gradebook, scores for p, q, and e. Find them and then complete each part of this question. (DO NOT MAKE UP YOUR OWN!) (a) Write down your p, q, and your e here. (b) Let n = pq. Compute o(n) and write it here. (c) Let E be the function from Z to Z to be used for encryption Write down its definition, i.e. E(x) = ?, which should feature your modulus n and your exponent e. (See the RSA Definition in our class slides.) (d) Compute ged(o(n), e) using the Extended Euclidean Algorithm. Write down each step below, ensuring that the r, column has descending values. Stop once you reach the row where r, is the GCD. Reduce the inverse of e that you find modulo (n). The result d will be the multiplicative inverse of e modulo (n) so write it below. To check your work, you should verify that de 1 (mod o(n)). but do not include this check. Use as many rows as needed below to complete your calculation. i qi T'i Fi Yi d= -1 1 0 0 0 1