Constructing Supersingular Elliptic Curves

@inproceedings{Brker2007ConstructingSE,
  title={Constructing Supersingular Elliptic Curves},
  author={Reinier Br{\"o}ker},
  year={2007}
}
We give an algorithm that constructs, on input of a prime power q and an integer t, a supersingular elliptic curve over Fq with trace of Frobenius t in case such a curve exists. If GRH holds true, the expected run time of our algorithm is e O((log q)). We illustrate the algorithm by showing how to construct supersingular curves of prime order. Such curves can readily be used for pairing based cryptography. 
Highly Cited
This paper has 31 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Horn , A heuristic asymptotic formula concerning the distribution of prime numbers

  • A. R.
  • Math . of Comp .
  • 2006

Primes of the form x2 + ny2

  • D. A. Cox
  • 1989

Elliptic functions, Springer Graduate Texts

  • S. Lang
  • in Mathematics,
  • 1987

Effective versions of the Chebotarev density theorem, Algebraic Number Fields, ed

  • J. C. Lagarias, A. M. Odlyzko
  • 1977
1 Excerpt

Similar Papers

Loading similar papers…