0
$\begingroup$

Let $p > 3$ be a prime such that $p \equiv 2 \pmod 3$. Define the elliptic curve $E$ over $\mathbb{F}_p$ by $y^2 = x^3 + 1$. Prove that $E(\mathbb{F}_p)$ consists of $p+1$ points.

Using Fermat's little theorem you can prove that $x^3 + 1$ is a bijection on $\mathbb{F}_p$. Hence, $\#E(\mathbb{F}_p) = \#\{(x,y) \in \mathbb{F}_p^2 : y^2 = x^3 + 1\} + \#\{\infty\} = \#\{(x,y) \in \mathbb{F}_p^2 : y^2 = x\} + 1.$ But then I am stuck trying to prove that $y^2 = x$ has $p$ solutions $(x,y) \in \mathbb{F}_p^2$.

  • 0
    @curious Consider the equations $y^2 = x^3 + 1$ and $y^2 = z$ over $\mathbb{F}_p$. The map $(x,y) \mapsto (z = x^3 + 1,y)$ is a bijection between their respective solution sets, because $x \mapsto x^3 + 1$ is a bijection on $\mathbb{F}_p$. In particular, the equations have the same number of solutions.2013-12-03

2 Answers 2

5

If any of $x,y$ is zero, then $x=y=0$ is the only solution pair. Otherwise, there are $\displaystyle\frac{p-1}2$ quadratic remainders $x$ and for each one exactly $2$ pieces of $y$'s belong ($\pm y$ once $y^2\equiv x$). It's altogether $1+2\cdot\displaystyle\frac{p-1}2=p$.

Or, an even easier approach: for each $y\in\Bbb F_p$ there is exactly one such $x$.

  • 0
    Your easy approach is nice. Thank you.2012-11-11