On character sums related to elliptic curves with complex multiplication (Q1903505): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Antoine Joux / rank
 
Normal rank
Property / author
 
Property / author: François Morain / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Dimitrios Poulakis / rank
 
Normal rank

Revision as of 15:55, 19 February 2024

scientific article
Language Label Description Also known as
English
On character sums related to elliptic curves with complex multiplication
scientific article

    Statements

    On character sums related to elliptic curves with complex multiplication (English)
    0 references
    16 July 1996
    0 references
    In 1975 \textit{T. Hadano} [Proc. Japan Acad. 51, 92-95 (1975; Zbl 0329.14018)]\ determined the most general equation of an elliptic curve defined over \(\mathbb{Q}\) with complex multiplication by the ring of integers of \(\mathbb{Q} (\sqrt {-d})\) \((d>0)\). There are nine such equations of the form \(y^2= f_d (x)\), where \(d=1, 2, 3, 7, 11, 19, 43, 67, 163\). Let \(p\) be a prime number and \((\cdot/p)\) the Legendre symbol. The sum of characters \(S_d (p)= \sum^{p-1}_{x=0} (f_d (x)/ p)\), is useful for the implementation of the primality test ECPP. So it is interesting to know its exact value. Rajwade and others, using the theory of complex multiplication, calculated the sum of characters \(S_d (p)\) for \(d=1, 2, 3, 7, 11, 19\). In the paper under review, the authors, simplifying the method of Rajwade, give the value of the sum \(S_d (p)\) for the last three cases. They prove that for \(d\in \{43, 67, 163\}\) we have \[ S_d (p)= \begin{cases} 0 &\text{ if } (-d/p) =-1,\\ (2/p) (u/d)u &\text{ if } (-d/p) =1\text{ and } 4p= u^2+ dv^2 \end{cases} \] {}.
    0 references
    elliptic curves with complex multiplication
    0 references
    character sums
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references