Elliptic Curve Variants of the Least Quadratic Nonresidue Problem and Linnik’s Theorem
نویسندگان
چکیده
Let E1 and E2 be Q-nonisogenous, semistable elliptic curves over Q, having respective conductors NE1 and NE2 and both without complex multiplication. For each prime p, denote by aEi(p) := p+1−#Ei(Fp) the trace of Frobenius. Under the assumption of the Generalized Riemann Hypothesis (GRH) for the convolved symmetric power L-functions L(s, SymE1 ⊗SymE2) where i, j ∈ {0, 1, 2}, we prove an explicit result that can be stated succinctly as follows: there exists a prime p ∤ NE1NE2 such that aE1(p)aE2(p) < 0 and p < ( (32 + o(1)) · logNE1NE2 )2 . This improves and makes explicit a result of Bucur and Kedlaya. Now, if I ⊂ [−1, 1] is a subinterval with Sato-Tate measure μ and if the symmetric power L-functions L(s, SymE1) are functorial and satisfy GRH for all k ≤ 8/μ, we employ similar techniques to prove an explicit result that can be stated succinctly as follows: there exists a prime p ∤ NE1 such that aE1(p)/(2 √ p) ∈ I and p < ( (21 + o(1)) · μ log(NE1/μ) )2 .
منابع مشابه
Rankin-selberg L–functions and the Reduction of Cm Elliptic Curves
Let q be a prime and K = Q( √ −D) be an imaginary quadratic field such that q is inert in K. If q is a prime above q in the Hilbert class field of K, there is a reduction map rq : E``(OK) −→ E``(Fq2) from the set of elliptic curves over Q with complex multiplication by the ring of integers OK to the set of supersingular elliptic curves over Fq2 . We prove a uniform asymptotic formula for the nu...
متن کاملThe new protocol blind digital signature based on the discrete logarithm problem on elliptic curve
In recent years it has been trying that with regard to the question of computational complexity of discrete logarithm more strength and less in the elliptic curve than other hard issues, applications such as elliptic curve cryptography, a blind digital signature method, other methods such as encryption replacement DLP. In this paper, a new blind digital signature scheme based on elliptic curve...
متن کاملComplete characterization of the Mordell-Weil group of some families of elliptic curves
The Mordell-Weil theorem states that the group of rational points on an elliptic curve over the rational numbers is a finitely generated abelian group. In our previous paper, H. Daghigh, and S. Didari, On the elliptic curves of the form $ y^2=x^3-3px$, Bull. Iranian Math. Soc. 40 (2014), no. 5, 1119--1133., using Selmer groups, we have shown that for a prime $p...
متن کاملAn efficient blind signature scheme based on the elliptic curve discrete logarithm problem
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme ...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کامل