Please enter verification code
A New Pseudorandom Sequence
American Journal of Applied Scientific Research
Volume 2, Issue 5, September 2016, Pages: 29-32
Received: Aug. 30, 2016; Accepted: Oct. 5, 2016; Published: Nov. 21, 2016
Views 3835      Downloads 69
Sun Quanling, Department of Electronic and Information Engineering, Anhui Jianzhu University, HeFei, China
Lv Hong, Department of Electronic and Information Engineering, Anhui Jianzhu University, HeFei, China
Chen Wanli, Department of Electronic and Information Engineering, Anhui Jianzhu University, HeFei, China
Qi Peng, Department of Electronic and Information Engineering, Anhui Jianzhu University, HeFei, China
Article Tools
Follow on us
The m-sequence is a type of pseudorandom sequence that has been studied intensively. However, its security is threatened due to its low linear complexity. Based on the state transition rules of the m-sequence, our research group has proposed a new sequence by changing its state transition order. This provides a large number of sequences with similar levels of pseudo-randomness and autocorrelation as the m-sequence. Additionally, its linear complexity is greatly improved.
m-sequence, State Transition, Conjugate State Pair, m-subsequence, Linear Complexity
To cite this article
Sun Quanling, Lv Hong, Chen Wanli, Qi Peng, A New Pseudorandom Sequence, American Journal of Applied Scientific Research. Vol. 2, No. 5, 2016, pp. 29-32. doi: 10.11648/j.ajasr.20160205.12
Copyright © 2016 Authors retain the copyright of this article.
This article is an open access article distributed under the Creative Commons Attribution License ( which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Behrouz A. Forouzan. Cryptography and Network Security [M]. BeiJing, Tsinghua. 2009: 242-244.
Gao Hongxun, A Method and Proof of n Level M Sequence and its Feedback Function [J]. ACTA MATHEMATICAE APPLACATAE SINICA. 2(4), 1979, 11, 316-324. (in chinese).
LV Hong, DUAN Ying-ni, GUAN Bi-cong, et al. Construction of First Class of m subsequences [J]. Acta Electronica Sinica, 35(10), 2007.10, 2029 -2031. (in chinese).
LV Hong, ZHANG Ai-xue, et al. Study of the Non-linear Feedback Functions and a class Subsequence Base on the Root-functions [J]. Acta Electronica Sinica, 40(10), 2012, 10, 2127-2132. (in chinese).
Taejoo Chang, Iickho Song, Sung Ho Cho. Some Properties of Cross Join Pairs in Maximum Length Linear Sequences. [c] 1990 ternational Symposium on Information Theory and Its Applications, Hawaii, U.S.A., November 27-30
Goresky M, Klapper A, Algebraic Shift Register Sequences [M], Cambridge University Press, 2012.
Tor Helleseth, Torleiv Klove, The number of Cross-Join Pairs in Maximum Length Linear Sequences.IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 3, NO. 6, NOVEMBER 1991.1731-1733.
Lv Hong, Xie Jianxia, Qi Peng. Generating of A Nonlinear Pseudorandom sequence Using Linear Feedback Shift Register [C]. Proceedings of 2012 International Conference on ICICT, 2012, 10, 432-435.
LV Hong, QI Peng et al. Constuction and Analysis of a Class Non-linear Spread Spetrum Sequence [J]. Acta Electronica Sinica, 41(10), 2013.10, 1939-1943. (in chinese).
FANG Jun-chu, LV Hong et al. C language implementation of a nonlinear sequence generated by m sequence [J].Journal of Henan University of Science and Technology: Natural Science Edition. 34(6), 2013, 12, 47-49. (in chinese).
GAO Jun-tao, Study on Design and Analysis of Pseudorandom Sequences [D]. Xian, XIDIAN UNIVISITY, 2006. (in chinese)
LUO Qi-bin, ZHANG Jian, Status Quo and Development of Stream Cipher [J]. Information and Electronic Engineering, 4(1), 2006, 2, 75-79. (in chinese).
FENG Deng-guo, Status quo and trend of cryptography [J]. Journal of China Institute of Communications, 23(5) 2002, 5, 18-26.
LV Hong. Design and Implement of A Maximal Length Nonlinear Pseudorandom Sequencs [A]. Proceedings of the 2009 International Conference on Computer and Communications Security [C]. Hong Kong. China.2009: 64-67.
Science Publishing Group
1 Rockefeller Plaza,
10th and 11th Floors,
New York, NY 10020
Tel: (001)347-983-5186