On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields

  • David R. Kohel
  • Igor E. Shparlinski
Conference paper

DOI: 10.1007/10722028_24

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1838)
Cite this paper as:
Kohel D.R., Shparlinski I.E. (2000) On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields. In: Bosma W. (eds) Algorithmic Number Theory. ANTS 2000. Lecture Notes in Computer Science, vol 1838. Springer, Berlin, Heidelberg

Abstract

In the paper an upper bound is established for certain exponential sums, analogous to Gaussian sums, defined on the points of an elliptic curve over a prime finite field. The bound is applied to prove the existence of group generators for the set of points on an elliptic curve over \(\mathbb{F}_{q}\) among certain sets of bounded size. We apply this estimate to obtain a deterministic O(q1/2 + ε) algorithm for finding generators of the group in echelon form, and in particular to determine its group structure.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • David R. Kohel
    • 1
  • Igor E. Shparlinski
    • 2
  1. 1.School of Mathematics and StatisticsUniversity of SydneyAustralia
  2. 2.Department of ComputingMacquarie UniversityAustralia

Personalised recommendations