作者: Georg-Johann Lay , Horst G. Zimmer
关键词: Elliptic curve 、 Counting points on elliptic curves 、 Supersingular elliptic curve 、 Edwards curve 、 Hessian form of an elliptic curve 、 Complex multiplication 、 Algebra 、 Schoof's algorithm 、 Twists of curves 、 Pure mathematics 、 Mathematics
摘要: A procedure is developed for constructing elliptic curves with given group order over large finite fields. The generality of the construction allows an arbitrary choice parameters involved. For instance, it possible to specify field, or class number endomorphism ring curve. This important various applications in computational theory and cryptography. Moreover, we give a method that yields all representations integer as norm imaginary quadratic field.