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.
| Published in | American Journal of Applied Scientific Research (Volume 2, Issue 5) |
| DOI | 10.11648/j.ajasr.20160205.12 |
| Page(s) | 29-32 |
| Creative Commons |
This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited. |
| Copyright |
Copyright © The Author(s), 2016. Published by Science Publishing Group |
m-sequence, State Transition, Conjugate State Pair, m-subsequence, Linear Complexity
| [1] | Behrouz A. Forouzan. Cryptography and Network Security [M]. BeiJing, Tsinghua. 2009: 242-244. |
| [2] | 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). |
| [3] | 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). |
| [4] | 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). |
| [5] | 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 |
| [6] | Goresky M, Klapper A, Algebraic Shift Register Sequences [M], Cambridge University Press, 2012. |
| [7] | 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. |
| [8] | 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. |
| [9] | 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). |
| [10] | 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). |
| [11] | GAO Jun-tao, Study on Design and Analysis of Pseudorandom Sequences [D]. Xian, XIDIAN UNIVISITY, 2006. (in chinese) |
| [12] | 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). |
| [13] | FENG Deng-guo, Status quo and trend of cryptography [J]. Journal of China Institute of Communications, 23(5) 2002, 5, 18-26. |
| [14] | 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. |
APA Style
Sun Quanling, Lv Hong, Chen Wanli, Qi Peng. (2016). A New Pseudorandom Sequence. American Journal of Applied Scientific Research, 2(5), 29-32. https://doi.org/10.11648/j.ajasr.20160205.12
ACS Style
Sun Quanling; Lv Hong; Chen Wanli; Qi Peng. A New Pseudorandom Sequence. Am. J. Appl. Sci. Res. 2016, 2(5), 29-32. doi: 10.11648/j.ajasr.20160205.12
AMA Style
Sun Quanling, Lv Hong, Chen Wanli, Qi Peng. A New Pseudorandom Sequence. Am J Appl Sci Res. 2016;2(5):29-32. doi: 10.11648/j.ajasr.20160205.12
Share This Article
Twitter
Linked In
Facebook
Copy
Download@article{10.11648/j.ajasr.20160205.12,
author = {Sun Quanling and Lv Hong and Chen Wanli and Qi Peng},
title = {A New Pseudorandom Sequence},
journal = {American Journal of Applied Scientific Research},
volume = {2},
number = {5},
pages = {29-32},
doi = {10.11648/j.ajasr.20160205.12},
url = {https://doi.org/10.11648/j.ajasr.20160205.12},
eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ajasr.20160205.12},
abstract = {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.},
year = {2016}
}
TY - JOUR T1 - A New Pseudorandom Sequence AU - Sun Quanling AU - Lv Hong AU - Chen Wanli AU - Qi Peng Y1 - 2016/11/21 PY - 2016 N1 - https://doi.org/10.11648/j.ajasr.20160205.12 DO - 10.11648/j.ajasr.20160205.12 T2 - American Journal of Applied Scientific Research JF - American Journal of Applied Scientific Research JO - American Journal of Applied Scientific Research SP - 29 EP - 32 PB - Science Publishing Group SN - 2471-9730 UR - https://doi.org/10.11648/j.ajasr.20160205.12 AB - 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. VL - 2 IS - 5 ER -
Information
Email: