Abstract
We derive pseudorandom binary sequences from maximal length sequences over the integral residue rings. We prove that these derived binary sequences have guaranteed large periods, and we also obtain upper bounds on their minimal polynomials in the sense of the partial order defined by divisibility.
Article PDF
Similar content being viewed by others
References
H. Beker and F. Piper,Cipher Systems, Northwood Books, London, 1982.
A. M. Frieze, J. Hastad, R. kannan, J. C. Lagarias, and A. Shamir, Reconstructing Truncated Integer Variables Satisfying Linear Congruences,SIAM J. Comput.,17, 262–280 (1988).
M. Q. Huang, Analysis and Cryptology Evaluation on Primitive Sequences, Ph.D. Dissertation, Department of Mathematics, Graduate School, Academia Sinica, Beijing, 1988.
R. Lidl and H. Niederreiter,Finite Fields, Encyclopaedia of Mathematics and Its Applications, Vol. 20, Addison-Wesley, Reading, MA, 1983.
R. A. Rueppel,Analysis and Design of Stream Ciphers, Springer-Verlag, Berlin, 1986.
M. Ward, The Arithmetical Theory of Linear Recurring Series,Trans. Amer. Math. Soc.,35, 600–628 (July 1933).
N. Zierler and W. H. Mills, Products of Linear Recursive Sequences,J. Algebra,27, 147–157 (1973).
Author information
Authors and Affiliations
Additional information
Communicated by Rainer A. Rueppel
This research was supported by SERC Grant GR/F 72727. The author is on leave from the Department of Mathematics, Graduate School, Academia Sinica, 3908 Beijing, People's Republic of China.
Rights and permissions
About this article
Cite this article
Dai, ZD. Binary sequences derived from ML-sequences over rings I: Periods and minimal polynomials. J. Cryptology 5, 193–207 (1992). https://doi.org/10.1007/BF02451115
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02451115