Distribution of some sequences of points on elliptic curves
Open Access
- 1 January 2007
- journal article
- Published by Walter de Gruyter GmbH in Journal of Mathematical Cryptology
- Vol. 1 (1) , 1-11
Abstract
We estimate character sums over points on elliptic curves over a finite field of q elements. Pseudorandom sequences can be constructed by taking linear combinations with small coefficients (for example, from the set {−1, 0, 1}) of a fixed vector of points, which forms the seed of the generator. We consider several particular cases of this general approach which are of special practical interest and have occurred in the literature. For each of them we show that the resulting sequence has good uniformity of distribution properties.Keywords
This publication has 10 references indexed in Scilit:
- On the Linear Complexity and Multidimensional Distribution of Congruential Generators over Elliptic CurvesDesigns, Codes and Cryptography, 2005
- Koblitz curve cryptosystemsFinite Fields and Their Applications, 2005
- Improved Algorithms for Efficient Arithmetic on Elliptic Curves Using Fast EndomorphismsLecture Notes in Computer Science, 2003
- Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms2001
- CM-Curves with Good Cryptographic Properties2001
- Signed bits and fast exponentiationJournal de Théorie des Nombres de Bordeaux, 2001
- Efficient Arithmetic on Koblitz CurvesDesigns, Codes and Cryptography, 2000
- Elliptic Curve Cryptosystems over Small Fields of Odd CharacteristicJournal of Cryptology, 1999
- Fast Multiplication on Elliptic Curves over Small Fields of Characteristic TwoJournal of Cryptology, 1998
- On Exponential Sums in Finite FieldsAmerican Journal of Mathematics, 1966