Autocorrelation of two Legendre-Sidelnikov sequences

中国邮电高校学报(英文) ›› 2014, Vol. 21 ›› Issue (5): 83-88.doi:

Autocorrelation of two Legendre-Sidelnikov sequences

谢佳,高军涛,岳曌,李雪莲

西安电子科技大学

收稿日期:2013-05-20 修回日期:2014-06-19 出版日期:2014-10-31 发布日期:2014-10-30
通讯作者: 谢佳 E-mail:xiejia199325@163.com
基金资助:
国家自然科学基金资助项目;保密通信重点实验室基金资助项目;中央高校进本科研业务费专项基金资助项目

Autocorrelation of two Legendre-Sidelnikov sequences

Received:2013-05-20 Revised:2014-06-19 Online:2014-10-31 Published:2014-10-30
Contact: Jia XIE E-mail:xiejia199325@163.com
Supported by:
the Natural Science Foundation of China;Science and Technology on Communication Security Laboratory;The Fundamental Research Funds for the Central Universities

摘要/Abstract

摘要： 　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.

关键词: autocorrelation, pseudo-randomness, binary sequence, quadratic character, Legendre-Sidelnikov sequence, two-prime generator

Abstract: 　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.

Key words: autocorrelation, pseudo-randomness, binary sequence, quadratic character, Legendre-Sidelnikov sequence, two-prime generator

中图分类号:

TN918.1

参考文献

1. Golomb S W, Gong G. Signal design for good correlation: for wireless communication, cryptography, and radar. New York, NY, USA: Cambridge University Press, 2005: 117-124

2. Garcia A, Stichtenoth H. Topics in geometry, coding theory and cryptography. Berlin, Germany: Springer, 2007:135-166

3. Woungang I, Misra S, Misra S C. Selected topics in information and coding theory. Hackensack, NJ, USA: World Scientific Press, 2010: 3-40

4. Schneier B. Applied cryptography: protocols, algorithms and source code in C. 2nd ed. Weinheim , Germany: Wiley-VCH Press, 1996: 382-384

5. Su M, Winterhof A. Autocorrelation of Legendre-Sidelnikov sequences. IEEE Transactions on Information Theory, 2010, 56(4): 1714-1718

6. Brandstätter N, Winterhof A. Some notes on the two-prime generator of order 2. IEEE Transactions on Information Theory, 2005, 51(10): 3645-3647

7. Cusick T W, Ding C S, Renvall A. Stream ciphers and number theory. 2nd ed. Amsterdam, Netherlands: Elsevier , 2004: 11-80

8. Michilovich S V. Some k-valued pseudorandom sequences and nearly equidistant codes. Problems of Information Transmission, 1969, 5(1): 12-16

9. Brandstätter N, Pirsic G, Winterhof A. Correlation of the two-prime Sidel’nikov sequence. Designs. Codes and Cryptography, 2011, 59(1-3): 59-68

10. Jungnickel D. Finite fields: structure and arithmetics. Mannheim, Germany: Bibliographisches Institut Wissenschaftsverlag Press, 1993

11. Ireland K, Rosen M. A Classical introduction to modern number theory. 2nd ed. Berlin, Germany: Springe, 1990: 50-58

12. Lempel A, Cohn M, Eastman W L. A class of balanced binary sequences with optimal autocorrelation properties. IEEE Transactions on Information Theory,1977, 23(1): 38-42

13. Cai Y. Binary pseudorandom sequences with good autocorrelation. Ph D Thesis. Beijing, China: Beijing Jiaotong University, 2009 (in Chinese)

[1]	李富林, ZHU Shi-xin. Computing the k-error joint linear complexity of binary periodic multisequences [J]. Acta Metallurgica Sinica(English letters), 2013, 20(6): 96-101.
[2]	贾艳艳胡予濮赵勇斌高军涛. Correlation power analysis of DECIMv2[J]. Acta Metallurgica Sinica(English letters), 2011, 18(5): 118-123.
[3]	王艳, HU Yu-pu, LI Shun-bo, YANG Yang. Linear complexity of sequences produced by single cycle T-function[J]. Acta Metallurgica Sinica(English letters), 2011, 18(4): 123-128.
[4]	许丽卿陈豪. Some results on the algebraic immunity of Boolean functions[J]. Acta Metallurgica Sinica(English letters), 2011, 18(2): 102-105.
[5]	柯品惠张胜元. Constructions of vector output Boolean functions with high generalized nonlinearity[J]. Acta Metallurgica Sinica(English letters), 2008, 15(2): 77-81.
[6]	陈秀波;杜建忠;温巧燕;朱甫臣. Teleportation of an unknown two-particle entangled state via an asymmetric three-particle entanglement state[J]. Acta Metallurgica Sinica(English letters), 2008, 15(1): 102-105.

Autocorrelation of two Legendre-Sidelnikov sequences

Autocorrelation of two Legendre-Sidelnikov sequences

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 6

编辑推荐

Metrics

本文评价