Abstract
Cross-correlation functions are determined for a large class of geometric sequences based on m-sequences in characteristic two. These sequences are shown to have low cross-correlation values in certain cases. They are also shown to have significantly higher linear complexities than previously studied geometric sequences. These results show that geometric sequences are candidates for use in spread-spectrum communications systems in which cryptographic security is a factor.
Similar content being viewed by others
References
M. Antweiller and L. Bohmer, Complex sequences overGF(p M) with a two-level autocorrelation function and a large linear span, manuscript.
L. Brynielsson, On the linear complexity of combined shift register sequences,Advances in Cryptology: Proc. Eurocrypt '85, Lecture Notes in Computer Science, Springer-Verlag: Berlin (1985) pp. 156–160.
A.H. Chan and R. Games, On the linear span of binary sequences from finite geometries,q odd,Advances in Cryptology: Proc. Crypto '86, Lecture Notes in Computer Science, Springer-Verlag: Berlin, (1987) pp. 405–417.
A.H. Chan, M. Goresky, and A. Klapper, Correlation functions of geometric sequences,Advances in Cryptology: Proc. Eurocrypt '90, Lecture Notes in Computer Science Vol. 473, (ed.) I.B. Damgard), Springer-Verlag: Berlin, (1991) pp. 214–221.
S. Golomb,Shift Register Sequences, Aegean Park Press: Laguna Hills, CA, (1982).
B. Gordon, W.H. Mills, and L.R. Welch, Some new difference sets,Canad. J. Math. Vol. 14, (1962) pp. 614–625.
a. Klapper, A.H. Chan, and M. Goresky, Cross-correlations of linearly and quadratically related geometric sequences and GMW sequences, in press,Discrete Applied Mathematics.
A. Klapper, A.H. Chan, and M. Goresky, Cascaded GMW Sequences,IEEE Trans. Info. Thy., Vol. IT-39 (1993), pp. 177–183.
A. Klapper, The vulnerability of geometric sequences based on fields of odd characteristic,Journal of Cryptology, Vol. 6 (1993).
R. Lidl and H. Niederreiter,Finite Fields in Encyclopedia of Mathematics Vol. 20, Cambridge University Press, Cambridge, 1983.
J.L. Massey, Shift register sequences and BCH decoding,IEEE Trans. Info. Thy., Vol. IT-15, (1969) pp. 122–127.
R. McEliece,Finite Fields for Computer Scientists and Engineers, Kluwer Academic Publishers: Boston, (1987).
J. No and P.V. Kumar, A new family of binary pseudorandom sequences having optimal periodic correlation properties and large linear span.IEEE Trans. on Inf. Th., Vol. 35, (1989) pp. 371–379.
O. Rothaus, On bent functions,Journal of Combinatorial Theory Series A, Vol. 20, (1976) pp. 300–305.
M. Simon, J. Omura, R. Scholtz, and B. Levitt,Spread-Spectrum Communications, Vol. 1, New York: Computer Science Press, 1985.
J. Wolfmann, New bounds on cyclic codes from algebraic curves,Proc. 1988 Conference on Coding Theory and Its Applications, Lecture Notes in Computer Science Vol. 388, (G. Cohen, J. Wolfmann, eds.), Springer-Verlag: Berlin, (1989) pp. 47–62.
N. Zierler and W. Mills, Products of linearly recurring sequences,Journal of Algebra, Vol. 27, (1973) pp. 147–157.
Author information
Authors and Affiliations
Additional information
Communicated by R. Mullin
Project sponsored by the National Security Agency under Grant Number MDA904-91-H-0012. The United States Government is authorized to reproduce and distribute reprints notwithstanding any copyright notation hereon.
Rights and permissions
About this article
Cite this article
Klapper, A. Cross-correlations of geometric sequences in characteristic two. Des Codes Crypt 3, 347–377 (1993). https://doi.org/10.1007/BF01418531
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01418531