论文信息 - Proof of a conjecture and a bound on the imbalance properties of LFSR subsequences

Proof of a conjecture and a bound on the imbalance properties of LFSR subsequences

Linear feedback shift registers (LFSRs) are widely used in cryptography, circuit testings and communications. In this paper, we prove a conjecture on a trigonometric inequality. Using this inequality, we investigate the imbalance properties of LFSR subsequences and deduce an upper bound.

Chik How Tan | Qichun Wang | C. Tan | Qichun Wang

[1] S. Lang. Algebraic Number Theory , 1971 .

[2] Andrew Klapper,et al. Distribution Properties of Half- \ell -Sequence , 2014, SETA.

[3] Solomon W. Golomb,et al. Periodic Binary Sequences: Solved and Unsolved Problems , 2007, SSC.

[4] Harish K. Pillai,et al. On the Number of Linear Feedback Shift Registers With a Special Structure , 2012, IEEE Transactions on Information Theory.

[5] Harald Niederreiter,et al. Introduction to finite fields and their applications: Preface , 1994 .

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

[7] Chik How Tan,et al. New bounds on the imbalance of a half-l-sequence , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[8] A. Atkin,et al. Modular Forms , 2017 .

[9] Solomon W. Golomb,et al. Sequences, Subsequences, and Consequences, International Workshop, SSC 2007, Los Angeles, CA, USA, May 31 - June 2, 2007, Revised Invited Papers , 2007, SSC.

[10] Henk D. L. Hollmann. Design of test sequences for VLSI self-testing using LFSR , 1990, IEEE Trans. Inf. Theory.

[11] Kaisa Nyberg,et al. Correlation Theorems in Cryptanalysis , 2001, Discret. Appl. Math..