1
$\begingroup$

Let $E$ be a supersingular elliptic curve which is defined over $\mathbb{F}_q$ and $P\in E$. Then there exist a distortion map with respect to $P$. I am looking for an algorithm which finds the map and the complexity of the algorithm.

$\endgroup$
0

1 Answer 1

1
$\begingroup$

The paper "Easy Decision-Diffie-Hellman Groups" by S. Galbraith and V. Rotger contains such an algorithm, which requires a polynomial number of operations.

$\endgroup$
1
  • $\begingroup$ That algorithm constructs an elliptic curve together with a distortion map. The question asks about finding a distortion map for a given curve, which is usually much more difficult. $\endgroup$
    – yyyyyyy
    Feb 18 at 3:57

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.