论文信息 - Large Periods Nearly de Bruijn FCSR Sequences

Large Periods Nearly de Bruijn FCSR Sequences

Recently, a new class of feedback shift registers (FCSRs) was introduced, based on algebra over the 2-adic numbers. The sequences generated by these registers have many algebraic properties similar to those generated by linear feedback shift registers. However, it appears to be significantly more difficult to find maximal period FCSR sequences. In this paper we exhibit a technique for easily finding FCSRs that generate nearly maximal period sequences. We further show that these sequence have excellent distributional properties. They are balanced, and nearly have the deBruijn property for distributions of subsequences.

Mark Goresky | Andrew Klapper

[1] David M. Mandelbaum,et al. Arithmetic codes with large distance , 1967, IEEE Trans. Inf. Theory.

[2] Edwin L. Key,et al. An analysis of the structure and complexity of nonlinear binary sequence generators , 1976, IEEE Trans. Inf. Theory.

[3] D. Gollman. Pseudo random properties of cascade connections of clock controlled shift registers , 1985 .

[4] Mark Goresky,et al. 2-Adic Shift Registers , 1993, FSE.

[5] Andrew Klapper,et al. Feedback with Carry Shift Registers over Finite Fields (extended abstract) , 1994, FSE.

[6] Mark Goresky,et al. Feedback Registers Based on Ramified Extensions of the 2-Adic Numbers (Extended Abstract) , 1994, EUROCRYPT.

[7] C. Hooley. On Artin's conjecture. , 1967 .

[8] N. Koblitz. p-adic Numbers, p-adic Analysis, and Zeta-Functions , 1977 .

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

[10] K. Brown,et al. Graduate Texts in Mathematics , 1982 .

[11] E. Wright,et al. An Introduction to the Theory of Numbers , 1939 .

[12] J. Pollard,et al. The fast Fourier transform in a finite field , 1971 .