论文部分内容阅读
Sequences with nice pseudo-randomness play an important role in not only communication system but also cryptography system. Based on the Legendre-Sidelnikov sequence, a modified Legendre-Sidelnikov sequence was introduced. The exact value of the autocorrelation function was derived by strict computation. According to the values of the autocorrelation functions of the two Legendre-Sidelnikov sequences, it is proven that both of them have perfect pseudo-randomness. Furthermore, a detailed comparison between autocorrelation functions of the two Legendre-Sidelnikov sequences was deduced. It indicates that no matter which parameters are chosen, the modified sequence has pseudo-randomness as good as the primitive sequence, which is of great significance for applications.
Sequences with nice pseudo-randomness play an important role in not only communication system but also cryptography system. Based on the Legendre-Sidelnikov sequence, a modified Legendre-Sidelnikov sequence was introduced. The exact value of the autocorrelation function was derived by strict computation. According to the values of the autocorrelation functions of the two Legendre-Sidelnikov sequences, it is proven that both have them perfect perfect-randomness. no matter which parameters are chosen, the modified sequence has pseudo-randomness as good as the primitive sequence, which is of great significance for applications.