Corpus ID: 16930978

CONSTRUCTING SUPERSINGULAR ELLIPTIC CURVES

@inproceedings{Brker2007CONSTRUCTINGSE,
  title={CONSTRUCTING SUPERSINGULAR ELLIPTIC CURVES},
  author={Reinier Br{\"o}ker},
  year={2007}
}
  • Reinier Bröker
  • Published 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. 
    34 Citations
    On division polynomial PIT and supersingularity
    • Javad Doliskani
    • Mathematics, Computer Science
    • Applicable Algebra in Engineering, Communication and Computing
    • 2018
    • 1
    • PDF
    Identifying supersingular elliptic curves
    • 17
    • PDF
    A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves
    • 71
    • PDF
    Elliptic curves generation for isogeny-based cryptosystems
    • 1
    Computational problems in supersingular elliptic curve isogenies
    • 36
    • PDF
    Supersingular Curves With Small Non-integer Endomorphisms
    • 8
    • PDF
    Rational isogenies from irrational endomorphisms
    • 11
    • Highly Influenced
    • PDF
    Quickly constructing curves of genus 4 with many points
    • 4
    • PDF
    Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
    • 104
    • PDF

    References

    SHOWING 1-10 OF 15 REFERENCES
    Computing Hilbert Class Polynomials
    • 57
    • PDF
    ABELIAN VARIETIES OVER FINITE FIELDS.
    • S. Lang
    • Mathematics, Medicine
    • Proceedings of the National Academy of Sciences of the United States of America
    • 1955
    • 232
    • PDF
    Action of Modular Correspondences around CM Points
    • 40
    Handbook of Elliptic and Hyperelliptic Curve Cryptography
    • 1,026
    • PDF
    A p-adic algorithm to compute the Hilbert class polynomial
    • 16
    • PDF
    The complexity of class polynomial computation via floating point approximations
    • A. Enge
    • Mathematics, Computer Science
    • Math. Comput.
    • 2009
    • 79
    • PDF
    ELLIPTIC FUNCTIONS
    • 605
    • PDF
    Modern computer algebra
    • R. Taylor
    • Mathematics, Computer Science
    • SIGA
    • 2002
    • 941
    • PDF
    Elliptic functions, Springer Graduate Texts
    • in Mathematics,
    • 1987