Journal on Communications ›› 2016, Vol. 37 ›› Issue (Z1): 25-29.doi: 10.11959/j.issn.1000-436x.2016243

• Contents Papers • Previous Articles     Next Articles

Analysis of super-long and sparse feature in pseudo-random sequence based on similarity

Chun-jie CAO1,2,Jing-zhang SUN1,Zhi-qiang ZHANG1,Long-juan WANG1,Meng-xing HUANG1,2   

  1. 1 State Key Laboratory of Marine Resource Utilization in the South China Sea,Hainan University,Haikou 570228,China
    2 College of Information Science&Technology,Hainan University,Haikou 570228,China
  • Online:2016-10-25 Published:2017-01-17
  • Supported by:
    The National Natural Science Foundation of China;The Major Science and Technology Project of Hainan Province;The Natural Science Foundation of Hainan Province

Abstract:

Similarity analysis of pseudo-random sequence in wireless communication networks is a research hotspot problem in the domain of information warfare.Based on the difficulties in super-long sequence,extremely sparse feature,and futilities in engineering application for real-time processing exist in similarity analysis of sequence in wireless net-work,a method of similarity analysis of sequence in a certain margin of misacceptance probability was proposed.Firstly,the similarity probability distribution of real-random sequence was theoretically analyzed.Secondly,according to the standard of NIST SP 800-22,the randomness of pseudo-bitstream was analyzed and the validity of pseudo-bitstream was judged.Finally,similarity was analyzed and verified by combining super-long pseudo-random sequence in real wireless communication networks.The results indicate that the lower bound of similarity value is 0.62 when misacceptance prob-ability uncertainty at about 1%.Above conclusion is considerable importance from the significance and theoretical values in network security domains,such as protocol analysis,traffic analysis,intrusion detection and others.

Key words: pseudo-random sequence, similarity, sparse feature, super-long feature

No Suggested Reading articles found!