The vulnerability of geometric sequences based on fields of odd characteristic

A new method of cryptologic attack on binary sequences is given, using their linear complexities relative to odd prime numbers. We show that, relative to a particular prime number p, the linear complexity of a binary geometric sequence is low. It is also shown that the prime p can be determined with high probability by a randomized algorithm if a number of bits much smaller than the linear complexity is known. This determination is made by exploiting the imbalance in the number of zeros and ones in the sequences in question, and uses a new statistical measure, the partial imbalance.

[1]  F. Jessie MacWilliams,et al.  On the p-Rank of the Design Matrix of a Difference Set , 1968, Inf. Control..

[2]  Manuel Blum,et al.  How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[3]  H. Bauer,et al.  Probability Theory and Elements of Measure Theory , 1982 .

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

[5]  Richard A. Games,et al.  On the Linear Span of binary Sequences Obtained from Finite Geometries , 1986, CRYPTO.

[6]  Andrew Chi-Chih Yao,et al.  Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[7]  Neal Zierler,et al.  Products of linear recurring sequences , 1973 .

[8]  R. McEliece.  Finite Fields for Computer Scientists and Engineers , 1986 .

[9]  Tore Herlestam,et al.  On Functions of Linear Shift Register Sequences , 1985, EUROCRYPT.

[10]  R. McEliece.  Finite field for scientists and engineers , 1987 .

[11]  Mark Goresky,et al.  Revealing Information with Partial Period Correlations (Extended Abstract) , 1991, ASIACRYPT.

[12]  Laurence B. Milstein,et al.  Spread-Spectrum Communications , 1983 .

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

[14]  Mark Goresky,et al.  Cross-Correlations of Linearly and Quadratically Related Geometric Sequences and GMW Sequences , 1993, Discret. Appl. Math..

[15]  K.J.C. Smith,et al.  On the p-rank of the incidence matrix of points and hyperplanes in a finite projective geometry , 1969 .

[16]  Dominic J. A. Welsh,et al.  Codes and cryptography , 1988 .

[17]  Lennart Brynielsson,et al.  On the Linear Complexity of Combined Shift Register Sequences , 1985, EUROCRYPT.

[18]  Andrew Chi-Chih Yao,et al.  Theory and Applications of Trapdoor Functions (Extended Abstract) , 1982, FOCS.

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