Diffie-Hellman Can be expanded to be used with many parties · Can be extended to: Finite fields gfp Elliptic curves Galois field GF Computing discrete logarithms is closely related to factoring. If you can solve the discrete logarithm oblem, then you can factor. (The converse has proble never been proven to be true.9 Diffie-Hellman • Can be expanded to be used with many parties • Can be extended to: – Finite fields GFp – Elliptic curves – Galois field • Computing discrete logarithms is closely related to factoring. If you can solve the discrete logarithm problem, then you can factor. (The converse has never been proven to be true.) GF k 2