Lenstra’s method is an effective subexponential algorithm with applications in this field and involves computing points on an elliptic curve over a finite field. Diffie and Hellman name a protocol (10[1])in this field that is used to perform “exchanges” over a channel. This field relies on “hardness” assumptions (10[1])such as the discrete logarithm problem. So-called “primitives” like the hash SHA-1 are used (-5[1])as the basis (10[1])for systems in this field. (10[1])A public key (10[1])and a private (10[1])key are used in an algorithm in this field that relies on the difficulty of factoring large numbers, the RSA algorithm. For 10 points, name this branch of computer science that develops (10[1])secure communication methods. ■END■ (10[2]0[1])