Score:0

Finding of trace of Edward curve and proper $d$

ro flag

The obvious way for computing the trace of curve is counting the number of curve point and then compute the trace of the curve by $t=p+1-\#E$. Are there any faster way for computing the trace of the curve? The above way is very slow. This question is also following up the Finding of proper $d$ for Edward curve. I hadn't been receive the proper response for it.

kelalaka avatar
in flag
So, they are equivalent problems.
yyyyyyy avatar
in flag
You are probably looking for Schoof's algorithm (and its improved variant, the SEA algorithm due to Schoof, Elkies, and Atkin).
mehdi mahdavi oliaiy avatar
ro flag
Are there any code of generating of elliptic curve in GitHup or other sites?
mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.