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. (10[1])Diffie and Hellman name a protocol in this field that is used (10[1])to perform (10[1])“exchanges” over a channel. This field relies on “hardness” assumptions (10[1])such as the discrete (10[1])logarithm problem. So-called “primitives” like the hash SHA-1 are used as the basis for systems (10[1])in this field. A public key and a (10[1])private 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 secure (10[1])communication methods. ■END■