A one round protocol for tripartite Diffie-Hellman

Journal of Cryptology

Volumn 17, Issue 4, 2004, Pages 263-276

  Joux, Antoine ^a  

^a DCSSI Crypto Lab   (France)

Author keywords

Cryptosystem; Discrete logarithm; Elliptic curve; Key exchange; Pairing

Indexed keywords

ALGORITHMS; CURVE FITTING; NETWORK PROTOCOLS;

CRUPTOSYSTEM; DISCRETE LOGARITHMS; ELLIPTIC CURVE; KEY EXCHANGE; PAIRING;

CRYPTOGRAPHY;

EID: 23944461491     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00145-004-0312-y     Document Type: Article

References (44)

1. L. M. Adleman. The function field sieve. In Algorithmic Number Theory, volume 877 of Lecture Notes in Computer Science, pages 108-121. Springer-Verlag, Berlin, 1994.
2. L. M. Adleman and M. A. Huang. Function field sieve method for discrete logarithms over finite fields. In Information and Computation, volume 151, pages 5-16. Academic Press, New York, 1999.
3. S. Al-Riyami and K. Paterson. Tripartite authenticated key agreement protocols from pairings. http://eprint.iacr.org, 2002.
4. P. Barreto, H. Kim, B. Lynn, and M. Scott. Efficient algorithms for pairing-based cryptosystems. In M. Yung, editor, Proceedings of CRYPTO '2002, volume 2442 of Lecture Notes in Computer Science, pages 354-368. Springer-Verlag, Berlin, 2002.
5. P. Barreto, B. Lynn, and M. Scott. Constructing elliptic curves with prescribed embedding degrees. http://eprint.iacr.org, 2002.
6. D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. In J. Kilian, editor, Proceedings of CRYPTO '2001, volume 2139 of Lecture Notes in Computer Science, pages 213-229. Springer-Verlag, Berlin, 2001.
7. D. Boneh, B. Lynn, and H. Shacham. Short signatures from the Weil pairing. In C. Boyd, editor, Proceedings of ASIACRYPT '2001, volume 2248 of Lecture Notes in Computer Science, pages 514-532. Springer-Verlag, Berlin, 2001. Updated version available from the authors.
8. M. Burmester and Y. Desmedt. A secure and efficient conference key distribution system. In A. De Santis, editor, Advances in Cryptology -EUROCRYPT '94, volume 950 of Lecture Notes in Computer Science, pages 275-286. Springer-Verlag, Berlin, 1995.
9. Q. Cheng and S. Uchiyama. Nonuniform polynomial time algorithm to solve decisional Diffie-Hellman problem in finite fields under conjecture. In CR-RSA 2002, number 2271 in Lecture Notes in Computer Science, pages 290-299. Springer-Verlag, Berlin, 2002.
10. R. Dupont, A. Enge, and F. Morain. Building curves with arbitrary small MOV degree over finite prime fields, http://eprint.iacr.org, 2002.
11. M. Fouquet, P. Gaudry, and R. Harley. An extension of Satoh's algorithm and its implementation. J. Ramanujan Math. Soc., 15:281-318, 2000.
12. G. Frey and H. Rück. A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comput., 62:865-874, 1994.
13. S. Galbraith, K. Harrison, and D. Soldera. Implementing the tate pairing. In C. Fieker and D. Kohel, editors, Algorithmic Number Theory, volume 2369 of Lecture Notes in Computer Science, pages 324-337. Springer-Verlag, Berlin, 2002.
14. R. Harasawa, J. Shikata, J. Suzuki, and H. Imai. Comparing the MOV and FR reductions in elliptic curve cryptography. In J. Stern, editor, Advances in Cryptology - EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science, pages 190-205. Springer-Verlag, Berlin, 1999.
15. R. Harley. Elliptic curve point counting: 32003 bits. Available at http://listserv.nodak.edu/archives/-nmbrthry.html, August 2002.
16. A. Joux. A one round protocol for tripartite Diffie-Hellman. In W. Bosma, editor, Algorithmic Number Theory, volume 1838 of Lecture Notes in Computer Science, pages 385-394. Springer-Verlag, Berlin, 2000.
17. A. Joux. The Weil and Tate pairings as building blocks for public key cryptosystems. In C. Fieker and D. Kohel, editors, Algorithmic Number Theory, volume 2369 of Lecture Notes in Computer Science, pages 20-32. Springer-Verlag, Berlin, 2002.
18. A. Joux and R. Lercier. The function field sieve is quite special. In C. Fieker and D. Kohel, editors, Algorithmic Number Theory, volume 2369 of Lecture Notes in Comput Science, pages 431-445. Springer-Verlag, Berlin, 2002.
19. A. Joux and K. Nguyen. Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups. J. Cryptology, 16(4):239-247, 2003.
20. H. Kim, J. Park, J. Cheon, J. Park, J. Kim, and S. Hahn. Fast elliptic curve point counting using gaussian normal basis. In C. Fieker and D. Kohel, editors, Algorithmic Number Theory, volume 2369 of Lecture Notes in Computer Science, pages 292-307. Springer-Verlag, Berlin, 2002.
21. N. Koblitz and A. Menezes. Obstacles to the torsion-subgroup attack on the decision Diffie-Hellman problem. Technical Report CORR 2002-05, CACR, 2002. Available at http://www.cacr.math.uwaterloo-.ca/tech_reports.html.
22. G.-J. Lay and H. Zimmer. Constructing elliptic curves with given group order over large finite fields. In L. Adleman, editor, Algorithmic Number Theory, volume 877 of Lecture Notes in Computer Science, pages 250-263. Springer-Verlag, Berlin, 1994.
23. A. Lentra and E. Verheul. The XTR public key system. In Mihir Bellare, editor, Proceedings of CRYPTO '2000, volume 1880 of Lecture Notes in Computer Science, pages 1-19. Springer-Verlag, Berlin, 2000.
24. R. Lercier. Algorithmique des courbes elliptiques dans les corps finis. Thèse, École polytechnique, June 1997.
25. R. Lercier and D. Lubicz. Elliptic curve point counting, 100002 bits. Available at http://-listserv.nodak.edu/archives/nmbrthry.html, December 2002.
26. A. Lysyanskaya. Unique signatures and verifiable random functions from the DH-DDH separation. In M. Yung, editor, Proceedings of CRYPTO '2002, volume 2442 of Lecture Notes in Computer Science, pages 597-612. Springer-Verlag, Berlin, 2002.
27. U. Maurer. Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms. In Advances in Cryptology - CRYPTO '94, volume 839 of Lecture Notes in Computer Science, pages 271-281. Springer-Verlag, Berlin, 1994.
28. U. Maurer and S. Wolf. Diffie-Hellman oracles. In N. Koblitz, editor, Advances in Cryptology - Crypto '96, Volume 1109 of Lecture Notes in Computer Science, pages 268-282. Springer-Verlag, Berlin, 1996.
29. U. Maurer and S. Wolf. The relationship between breaking the Diffie-Hellman protocol and computing discrete logarithms. SIAM J. Comput., 28(5):1689-1721, 1999.
30. A. Menezes. Elliptic Curve Public Key Cryptosystems. Kluwer, Dordrecht, 1994.
31. A. Menezes, T. Okamoto, and S. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Inform. Theory, 39:1639-1646, 1993.
32. J.-F. Mesure. Lettre à Gaudry et Harley. Available from http://www.math.jussieu.fr/~mestre/, December 2000.
33. V. Miller. Short programs for functions on curves. Unpublished manuscript, 1986.
34. V. Miller. Use of elliptic curves in cryptography. In H. Williams, editor, Advances in Cryptology - CRYPTO '85, volume 218 of Lecture Notes in Computer Science, pages 417-428. Springer-Verlag, Berlin, 1986.
35. A. Miyaji, M. Nakabayashi, and S. Takano. New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans. Fundamentals, E84A(5):1234-1243, 2001.
36. F. Morain. Classes d'isomorphismes des courbes elliptiques supersingulières en caractéristiques ≥ 3. Util. Math., 52:241-253, December 1997.
37. R. Sakai, K. Ohgishi, and M. Kasahara. Cryptosystems based on pairing. In SCIS, Okinawa, Japan, 2000.
38. T. Satoh. The canonical lift of an ordinary elliptic curve over a finite field and its point counting. J. Ramanujan Math. Soc., 15:247-270, 2000.
39. T. Satoh and K. Araki. Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves. Comment. Math. Univ. St. Paul., 47:81-92, 1998.
40. I. Semaev. Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p. Math. Comp., 67:353-356, 1998.
41. J. Silverman. The Arithmetic of Elliptic Curves. Number 106 in Graduate Texts in Mathematics. Springer-Verlag, New York, 1992.
42. N. Smart. The discrete logarithm problem on elliptic curves of trace one. J. Cryptology, 12:193-196, 1999.
43. E. Verheul. Evidence that XTR is more secure than supersingular elliptic curve cryptosystems. In B. Pfizmann, editor, Proceedings of EUROCRYPT '2001, volume 2045 of Lecture Notes in Computer Science, pages 195-210. Springer-Verlag, Berlin, 2001.
44. F. Zhang, S. Liu, and K. Kim. ID-based one round authenticated tripartite key agreement protocol with pairings, http://eprint.iacr.org, 2002.