De Bruijn sequences for secure scrambling at Long Term Evolution - Advanced physical layer

The intent of the paper is to propose a new set of scrambling codes to spread information in a manner that provides superior physical layer security. In wireless communication systems, physical layer elements are vulnerable to possible security-related attacks by undesired entities. Basic premise of a reliable communication infrastructure is to mitigate risks related to violations of the user information integrity, authenticity, and to provide efficient control and management information flow. The 3GPP Long Term Evolution - Advanced achieves this goal by using robust scrambling technique for control channel information, by means of binary Gold sequences used as scrambling codes. Gold sequences provide good correlation-related properties, however they have been known for a long time, thus they are weak in security-related features, starting from their very limited cardinality. This paper suggests the use of De Bruijn sequences as the next generation set of scrambling codes, for their huge cardinality and satisfactory correlation-related properties. Different spans of De Bruijn codes are analyzed to examine their performance, with a specific emphasis on sequences of length 32, that are comparable to the Gold codes currently suggested by the standard. De Bruijn sequences are seen to provide much more favorable results, even with respect to security-related tests.

[1]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[2]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[3]  de Ng Dick Bruijn A combinatorial problem , 1946 .

[4]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[5]  Richard A. Games,et al.  On the Complexities of de Bruijn Sequences , 1982, J. Comb. Theory, Ser. A.

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

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

[8]  Akio Tsuneda,et al.  Performance evaluation of spreading sequences with negative auto-correlation based on chaos theory and Gold sequences , 2009, 2009 Fourth International Workshop on Signal Design and its Applications in Communications.

[9]  Richard A. Games,et al.  A fast algorithm for determining the complexity of a binary sequence with period 2n , 1983, IEEE Trans. Inf. Theory.

[10]  Tuvi Etzion,et al.  Construction of de Bruijn sequences of minimal complexity , 1984, IEEE Trans. Inf. Theory.

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

[12]  Guang Gong,et al.  Signal Design for Good Correlation: Preface , 2005 .