Paper 2004/070 Original: eprint.iacr.org/2004/070 ↗
Easy decision-Diffie-Hellman groups
Abstract
It is already known that the Weil and Tate pairings can be used to solve many decision-Diffie-Hellman (DDH) problems on elliptic curves. A natural question is whether all DDH problems are easy on supersingular curves. To answer this question it is necessary to have suitable distortion maps. Verheul states that such maps exist, and this paper gives methods to construct them. The paper therefore shows that all DDH problems on supersingular elliptic curves are easy. We also discuss the issue of which DDH problems on ordinary curves are easy. A related contribution is a discussion of distortion maps which are not isomorphisms. We give explicit distortion maps for elliptic curves with complex multiplication of discriminants $D=-7$ and $D=-8$.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2004-08-31: last updated
- 2004-03-02: published
- Short URL
- https://ia.cr/2004/070
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2004/070,
author = {Steven D Galbraith and Victor Rotger},
title = {Easy decision-Diffie-Hellman groups},
howpublished = {Cryptology {ePrint} Archive, Paper 2004/070},
year = {2004},
url = {https://eprint.iacr.org/2004/070}
}