A One Round Protocol for Tripartite Diffie–Hellman
- Cite this paper as:
- Joux A. (2000) A One Round Protocol for Tripartite Diffie–Hellman. In: Bosma W. (eds) Algorithmic Number Theory. ANTS 2000. Lecture Notes in Computer Science, vol 1838. Springer, Berlin, Heidelberg
In this paper, we propose a three participants variation of the Diffie-Hellman protocol. This variation is based on the Weil and Tate pairings on elliptic curves, which were first used in cryptography as cryptanalytic tools for reducing the discrete logarithm problem on some elliptic curves to the discrete logarithm problem in a finite field.
Unable to display preview. Download preview PDF.