Linear Recursive Sequences over Elliptic Curves

In this paper, we introduce linear feedback shift register sequences (LFSR) over the group of the elliptic curve points, and a construction of binary sequences obtained from these LFSR sequences. The former is called LFSR-EC sequences. Properties on representation, period, and linear span of these two types of sequences are discussed. Also, the even case for the elliptic curve sequence proposed in [5] is analysed.

[1]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[2]  Ian F. Blake,et al.  Elliptic curves in cryptography , 1999 .

[3]  Robert B. Ash,et al.  Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.

[4]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[5]  Michael Wiener,et al.  Advances in Cryptology — CRYPTO’ 99 , 1999 .

[6]  Rudolf Lide,et al.  Finite fields , 1983 .

[7]  Burton S. Kaliski,et al.  A Pseudo-Random Bit Generator Based on Elliptic Logarithms , 1986, CRYPTO.

[8]  Victor S. Miller,et al.  Use of Elliptic Curves in Cryptography , 1985, CRYPTO.

[9]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[10]  Solomon W. Golomb,et al.  Shift Register Sequences , 1981 .

[11]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[12]  Jerome A. Solinas,et al.  Improved Algorithms for Arithmetic on Anomalous Binary Curves , 1997 .

[13]  Nigel P. Smart,et al.  The Discrete Logarithm Problem on Elliptic Curves of Trace One , 1999, Journal of Cryptology.

[14]  Morgan Ward.  The characteristic number of a sequence of integers satisfying a linear recursion relation , 1931 .

[15]  Igor A. Semaev,et al.  Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p , 1998, Math. Comput..

[16]  Igor E. Shparlinski,et al.  On the Uniformity of Distribution of Congruential Generators over Elliptic Curves , 2001, SETA.

[17]  戴宗铎,et al.  LINEAR COMPLEXITY AND THE MINIMAL POLYNOMIAL OF LINEAR RECURRING SEQUENCES OVER Z/(m) , 1991 .

[18]  Sean Hallgren,et al.  Linear Congruential Generators Over Elliptic Curves , 2001 .

[19]  N. Koblitz.  Elliptic curve cryptosystems , 1987 .

[20]  Richard A. Games,et al.  On the linear span of binary sequences obtained from q-ary m-sequences, q odd , 1990, IEEE Trans. Inf. Theory.

[21]  Alfred Menezes,et al.  Elliptic curve public key cryptosystems , 1993, The Kluwer international series in engineering and computer science.

[22]  Guang Gong,et al.  Elliptic Curve Pseudorandom Sequence Generators , 1999, Selected Areas in Cryptography.

[23]  Takakazu Satoh,et al.  Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves , 1998 .