Let $\mathbb{F}_q$ be a large finite field. What if I invent how to efficiently construct pairs of elliptic "cryptographically strong" $\mathbb{F}_q$-curves $E_1$, $E_2$ isogenous over $\mathbb{F}_q$, that is $\#E_1(\mathbb{F}_q) = \#E_2(\mathbb{F}_q)$, in such a way that nobody (including me) knows an $\mathbb{F}_q$-isogeny between them ? Is this useful in discrete logarithm or isogeny-based cryptography ?

  • 1
    $\begingroup$ Yes, it's interesting. Please do it. $\endgroup$ Jul 27 at 15:49


Your Answer

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