Easy decision-Diffie-Hellman groups

@article{Galbraith2004EasyDG,
  title={Easy decision-Diffie-Hellman groups},
  author={Steven D. Galbraith and Victor Rotger},
  journal={IACR Cryptology ePrint Archive},
  year={2004},
  volume={2004},
  pages={70}
}
The decision-Diffie-Hellman problem (DDH) is an important computational problem in cryptography. It is known that the Weil and Tate pairings can be used to solve many DDH problems on elliptic curves. Distortion maps are an important tool for solving DDH problems using pairings and it is known that distortion maps exist for all supersingular elliptic curves. We present an algorithm to construct suitable distortion maps. The algorithm is efficient on the curves usable in practice, and hence all… CONTINUE READING
58 Citations
25 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 25 references

Elliptic functions Springer GTM

  • S. Lang
  • 1987
Highly Influential
4 Excerpts

Heights and special values of L-series

  • B. H. Gross
  • CMS proceedings, 7, AMS
  • 1986
Highly Influential
4 Excerpts

Arithmetic of quaternion algebras

  • M. F. Vignéras
  • Springer Lecture Notes in Mathematics 800
  • 1980
Highly Influential
5 Excerpts

Isogénies entre courbes elliptiques

  • J. Vélu
  • C.R. Acad. Sc. Paris, Série A, 273
  • 1971
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…