Summary
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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
P.H.T. Beelen, J.M. Doumen, Generating pseudo-random sequences using linear recurrency relations on elliptic curves, Sixth International Conference on Finite Fields and Applications, abstract, http://www.iztapalapa.uammx/fq6/, May 2001
E. R. Berlekamp, Algebraic coding theory, McGraw-Hill, New York, 1968.
A.H. Chan and R.A. Games, On the Linear Span of Binary Sequences Obtained from Q-Ary M-Sequences, Q Odd, IEEE Trans. Information Theory, Vol 36, No. 3, 548–552, 1990.
Z. Dai, M. Huang, Linear Complexity and the Minimal Polynomial of Linear Recurring Sequences over Z m , Systems Science and Mathematical Sciences, Vol. 4, No. 1, 51–54, Feb. 1991.
G. Gong, T Berson and D Stinson, Elliptic Curve Pseudorandom Sequence Generator, Proceedings of the Sixth Annual Workshop on Selected Areas in Cryptography, LNCS 1758, Springer-Verlag, 34–48, 1999.
SW Golomb, Shift Register Sequences, Holden-Day, Inc., 1967. Revised edition, Aegean Park Press, 1982.
G. Gong, C Lam, Randomness of Several Elliptic Curve Sequences, preprint, 2001.
S Hallgren, Linear congruential generators over elliptic curves, CS 94–143, Dept. of Comp. Sci., Carnegie Mellon University, 1994.
E.E. Mahassni and I Shparlinski, On the Uniformity of Distribution of Con-gruential Generators over Elliptic Curves, preprint, November 2000.
B. Kaliski, A Pseudo-Random Bit Generator Based on Elliptic Logarithms, Advances in Cryptology-Crypto ’86, Lecture Notes in Computer Science, LNCS 263(1986), Springer-Verlag, 84–103.
N. Koblitz, Elliptic Curve Cryptosystems, Mathematics of Computation (48), 203–209, 1987.
R. Lidl and H. Niederreiter, Finite Fields, Encyclopedia of Mathematics and its Applications, Volume 20, Addison-Wesley, 1983, Theorem 3.35, 97–98.
J. L. Massey, Shift-register synthesis and BCH decoding, IEEE Trans. Information Theory, January 1969.
A. J. Menezes, Elliptic Curve Public Key Cryptosystems, Kluwer Academic Publishers, 1993.
V Miller, Uses of Elliptic Curves in Cryptography, Advances in Cryptology — CRYPTO ’85, LNCS 218, Springer-Verlag, 417–426, 1986.
T. Satoh and K. Araki, Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves, Commentarii Mathematici Universitatis Sancti Paul, 47 (1998), 81–92.
I. Samaev, Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p, Mathematics of Computation, 67 (1998), 353–356.
N. Smart, The discrete logarithm problem on elliptic curves of trace one, Journal of Cryptology, 12 (1999), 193–196.
J. Solinas, Improved Algorithms for Arithmetic on Anomalous Binary Curves, CACR Technical Reports, CORR 99–46, University of Waterloo, 1999.
M. Ward, The characteristic number of a sequence of integers satisfying a linear recursion relation, Trans. Amer. Math. Soc., 33 (1931), 153–165.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag London
About this paper
Cite this paper
Gong, G., Lam, C.C.Y. (2002). Linear Recursive Sequences over Elliptic Curves. In: Helleseth, T., Kumar, P.V., Yang, K. (eds) Sequences and their Applications. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0673-9_13
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0673-9_13
Publisher Name: Springer, London
Print ISBN: 978-1-85233-529-8
Online ISBN: 978-1-4471-0673-9
eBook Packages: Springer Book Archive