On the elliptic curve analogue of the sum-product problem
نویسنده
چکیده
Let E be an elliptic curve over a finite field Fq of q elements and x(P ) to denote the x-coordinate of a point P = (x(P ), y(P )) ∈ E. Let ⊕ denote the group operation in the Abelian group E(Fq) of Fq -rational points on E. We show that for any sets R,S ⊆ E(Fq) at least one of the sets { x(R)+ x(S): R ∈R, S ∈ S} and {x(R⊕ S): R ∈R, S ∈ S} is large. This question is motivated by a series of recent results on the sum-product problem over Fq . © 2008 Elsevier Inc. All rights reserved.
منابع مشابه
Bilinear Character Sums and Sum–product Problems on Elliptic Curves
Let E be an ordinary elliptic curve over a finite field Fq of q elements. We improve a bound on bilinear additive character sums over points on E, and obtain its analogue for bilinear multiplicative character sums. We apply these bounds to some variants of the sum–product problem on E.
متن کامل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...
متن کاملBilinear Exponential Sums and Sum-Product Problems on Elliptic Curves
Let E be an ordinary elliptic curve over a finite field IFq of q elements. We improve a bound on bilinear additive character sums over points on E, and obtain its analogue for bilinear multiplicative character sums. We apply these bounds to some variants of the sum-product problem on E. 2000 Mathematics Subject Classification: Primary 11G05, 11L07, 11T23
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Finite Fields and Their Applications
دوره 14 شماره
صفحات -
تاریخ انتشار 2008