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