scientific article; zbMATH DE number 2154267
The paper presents a computational alternative to the construction by \textit{A. O. Atkin} and \textit{F. Morain} [Math. Comput. 61, No. 203, 29--69 (1993; Zbl 0792.11056)] of an elliptic curve defined over a finite prime field \(F_p\) and with a given number \(m\) of points (in the Hasse interval). The search of elliptic curves with a known number of points is of interest in cryptography (where one looks for prime cardinals) and in the Elliptic Curve Primality Proving (where one looks for elliptic curves with cardinal \(m=kq\)\, for a small integer \(k>1\)\, and \(q\) a probable prime). The method of Atkin uses complex multiplication techniques: chosen a (fundamental) discriminant \(D\) such that \(p\) splits in the ring of integers of the quadratic field \(K=\mathbb Q(\sqrt D)\),\, \(p=\pi\overline{\pi}\) and such that \(m=p+1-\pi-\overline{\pi}\)\, is a \textit{suitable} cardinal the polynomial of Hilbert \(H_D(X)\in Z[X]\)\, it is built. Then any elliptic curve with \(j\)-invariant a root of \(H_D(X)\bmod p\) has cardinal \(m\). The present proposal differs only in the calculation of \(H_D(X)\). While Atkin and Morain compute \(H_D(X)\) over the integers and then they reduce it modulo the prime \(p\), here the authors compute the polynomial directly modulo \(p\),\, without computing its (huge) integer coefficients. For so doing they first compute \(H_D(X)\)\, modulo sufficiently many small primes and then lift to \(H_D(X) \bmod p\), using a modified version of the Chinese Remainder Theorem (CRT). After reviewing (Section 2) Atkin's method, in Section 3 the paper outlines the proposed algorithm and analyzes its computational complexity arguing that, for large enough size of \(| D| \), such a complexity is better than Atkin-Morain's. Details of the algorithm are studied in Section 4 (computing \(H_D(X)\) modulo small primes) and Section 5 (modified version of the CRT). Finally Section 6 gives examples (for \(D= -59\) and \(D=-832603\)) of implementation (using the PARI software package) both for the Atkin-Morain and the CRT methods. For the entire collection see [Zbl 1051.11008].
- Constructing elliptic curves over finite fields using double eta-quotients
- Constructing elliptic curves and curves of genus 2 over finite fields
- A p-adic algorithm to compute the Hilbert class polynomial
- The complexity of class polynomial computation via floating point approximations
- Computing Hilbert class polynomials with the Chinese remainder theorem
- Modular exponentiation via the explicit Chinese remainder theorem
- A rapid procedure of creating elliptic curves applying to cryptography
- Constructing elliptic curves of prime order
- Efficient CM-constructions of elliptic curves over finite fields
- scientific article; zbMATH DE number 492864 (Why is no real title available?)
- Constructing elliptic curves with prescribed embedding degrees
- Computing Hilbert Class Polynomials
- Constructing Picard curves with complex multiplication using the Chinese remainder theorem
- What is your ``birthday elliptic curve?
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4664828)