2-adic Complexity of Binary M-sequences

Although 2 -adic complexity was proposed more than ten years ago, even for m -sequences which are thought of as the most important linear recurring sequences, no theoretical results about their 2-adic complexity has been presented. In this paper, it is shown that for a binary m-sequence, its 2-adic complexity attains the maximum, which implies that no feedback with carry shift registers (FCSRs) with connection integer less than 2 2 n -1 - 1 can generate m-sequences of order n .

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

[2]  K. Conrad,et al.  Finite Fields , 2018, Series and Products in the Development of Mathematics.

[3]  Mark Goresky,et al.  Feedback shift registers, 2-adic span, and combiners with memory , 1997, Journal of Cryptology.

[4]  H. Niederreiter,et al.  Finite Fields: Encyclopedia of Mathematics and Its Applications. , 1997 .

[5]  R. A. Rueppel.  Analysis and Design of Stream Ciphers , 2012 .

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

[7]  Sangjin Lee,et al.  A lower bound on the linear span of an FCSR , 2000, IEEE Trans. Inf. Theory.

[8]  Mark Goresky,et al.  Cryptanalysis Based on 2-Adic Rational Approximation , 1995, CRYPTO.

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