On the representation of primes by binary quadratic forms, and elliptic curves
It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of an elliptic curve over a finite field $\mathbb F_q$. F...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Published: |
Pushpa Publishing House
2018
|