Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Burmester, M., Desmedt, Y.: A secure and efficient conference key distribution system. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 275–286. Springer, Heidelberg (1995)
Chabaud, F., Lercier, R.: The ZEN library., http://www.dmi.ens.fr/~zen
Frey, G., Rück, H.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Mathematics of Computation 62, 865–874 (1994)
Harasawa, R., Shikata, J., Suzuki, J., Imai, H.: Comparing the MOV and FR reductions in elliptic curve cryptography. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 190–205. Springer, Heidelberg (1999)
Lay, G.-J., Zimmer, H.: Constructing elliptic curves with given group order over large finite fields. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol. 877, pp. 250–263. Springer, Heidelberg (1994)
Lercier, R.: Algorithmique des courbes elliptiques dans les corps finis. thése, École polytechnique (June 1997)
Menezes, A.: Elliptic curve public key cryptosystems. Kluwer Academic Publishers, Dordrecht (1994)
Menezes, A., Okamoto, T., Vanstone, S.: Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transaction on Information Theory 39, 1639–1646 (1993)
Miller, V.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417–428. Springer, Heidelberg (1986)
Semaev, I.: Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p. Mathematics of Computation 67, 353–356 (1998)
Smart, N.: The discrete logarithm problem on elliptic curves of trace one (1997) (preprint)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/10722028_23
Download citation
DOI: https://doi.org/10.1007/10722028_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67695-9
Online ISBN: 978-3-540-44994-2
eBook Packages: Springer Book Archive