JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2017, Vol. 52 ›› Issue (3): 24-31.doi: 10.6040/j.issn.1671-9352.2.2016.108

Previous Articles     Next Articles

On the linear complexity of a new generalized cyclotomic sequence with length p3 over GF(l)

LIU Long-fei, YANG Xiao-yuan   

  1. Key Laboratory of Network &
    Information Security of Armed Police Force, Engineering University of Armed Police Force, Xian 710086, Shaanxi, China
  • Received:2016-08-18 Online:2017-03-20 Published:2017-03-20

PDF (PC)

705

Abstract: Linear complexity is the most important index for measuring the randomness properties of sequences. Based on the Ding-generalized cyclotomy, a new class of generalized cyclotomic sequences with length p3 over the finite field of power of odd prime order is constructed, and the sequence is balanced. The linear complexity of the sequences is determined using the theory of polynomial over finite field. It is shown that the sequence has good linear complexity, and it can resist attacks from the application of the Berlekamp-Massey algorithm.

Key words: pseudo-random sequence, generalized cyclotomy, cryptography, linear complexity, stream cipher

CLC Number: 

  • TP309
[1] DING Cunsheng. Linear complexity of generalized cyclotomic binary sequences of order 2[J]. Finite Fields and Their Applications, 1997, 8:159-174.
[2] DING Cunsheng, HELLESETH T. New generalized cyclotomy and its applications[J]. Finite Fields and Their Applications, 1998, 4(2):140-166.
[3] CUSICK T W, DING Cunsheng, RENVALL A. Stream Ciphers and Number Theory[M]. Elsevier Science Pub Co, 1998, Chapter 3-8.
[4] YAN Tongjiang, HUANG Bingjia, XIAO Guozhen. Cryptographic properties of some binary generalized cyclotomic sequences with the length p2[J]. Information Sciences, 2008, 178(3):1078-1086.
[5] KIM Y, JIN S, SONG H. Linear complexity and autocorrelation of prime cube sequences[J]. Applicable Algebra in Engineering, Communication and Computing, 2007, LNCS 4851, 188-197.
[6] YAN Tongjiang, LI Shengqiang, XIAO Guozhen. On the linear complexity of generalized cyclotomic sequences with the period pm[J]. Applied Mathematics Letters, 2008, 21(2):187-193.
[7] DU Xiaoni, CHEN Zhixiong. Trace representation of binary generalized cyclotomic sequences with length pm[J]. IEICE Transaction on Fundamentals, 2011, E94-A(2):761-765.
[8] EDEMSKIY Vladimir. About computation of the linear complexity of generalized cyclotomic sequences with period pn+1[J]. International Journal of Soft Computing and Engineering, 2011, 1(3):2231-2307.
[9] WANG Qiuyan, JIANG Yupeng, LIN Dongdai. Linear complexity of binary generalized cyclotomic sequences over GF(q)[J]. Journal of Complexity, 2015, 31(5), 731-740.
[10] WANG Qiuyan, JIANG Yupeng, LIN Dongdai. Linear complexity of Ding-Helleseth sequences of order 2 over GF(l)[J]. Cryptography and Communications, 2015, DOI 10,1007/s12095-015-0138-5.
[11] FAN Cuiling, GE Gennian. A unified approach to whitemans and ding-helleseths generalized cyclotomy over residue class rings[J]. IEEE Transactions on Information Theory, 2014, 60(2):1326-1336.
[12] DING Cunsheng. Cyclic codes from the two primes sequences[J]. IEEE Transactions on Information Theory, 2012, 58(6):3881-3891.
[13] DING Cunsheng. Cyclic codes from cyclotomic sequences of order four[J]. Finite Fields and Their Applications, 2013, 23(1):8-34.
[14] ZENG Xiangyong, CAI Han, TANG Xiaohu, et al. Optimal frequency Hopping sequences of odd length[J]. IEEE Transactions on Information Theory, 2013, 59(5):3237-3248.
[15] CAI Han, ZHOU Zhengchun, YANG Yang, et al. A New construction of frequency-hopping sequences optimal partial hamming correlation[J]. IEEE Transactions on Information Theory, 2014, 60(9):5782-5790.
[16] CAI Han, LIANG Hongbin, TANG Xiaohu. Constructions of optimal 2-D optical orthogonal codes via generalized cyclotomic classes[J]. IEEE Transactions on Information Theory, 2015, 61(1):688-695.
[1] Ying LI,Jun HU. Hierarchical trusted cryptography service framework based on distributed message drive [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2020, 55(3): 19-27.
[2] Jun HU,Zi-peng DIAO. vTCM: a virtualized trusted cryptography module based on the virtualization of physical trusted computing environment [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2019, 54(7): 77-88.
[3] ZUO Li-ming, CHEN Lan-lan, ZHOU Qing. A certificate-based short signature scheme [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2019, 54(1): 79-87.
[4] CUI Zhao-yang, SUN Jia-qi, XU Song-yan, JIANG Xin. A secure clustering algorithm of Ad Hoc network for colony UAVs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(7): 51-59.
[5] Zhao-xia WU,Jia-qi WANG. Wireless single spectrum secure auction algorithm [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(11): 51-55.
[6] SU Yang. Reconfigurable design of Galois field multiplication in symmetric cryptography [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(6): 76-83.
[7] . Linear complexity of balanced quaternary generalized cyclotomic sequences with Period pq [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(9): 145-150.
[8] XU Sheng-wei. A new quantum secret sharing scheme [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(9): 36-40.
[9] . Cryptanalysis and improvement of two kind of certificateless aggregate signature schemes [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(7): 107-114.
[10] FAN Ai-wan, XIA Dong-liang, YANG Zhao-feng. Security analysis and improvement of two certificateless aggregate signature schemes [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2015, 50(09): 42-48.
[11] DU Rui-ying, LIU Ya-bin, LIU Jian-dong, LUO Hui-xia. A certificateless key-insulated signature Scheme [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2014, 49(09): 24-28.
[12] ZHAO Xiu-feng, WANG Ai-lan, WANG Xiang. Threshold scheme for LWE inversion [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2014, 49(07): 34-37.
[13] HOU Hong-xia1,2, ZHANG Xue-feng2, DONG Xiao-li2. Improved certificateless aggregate signature scheme [J]. J4, 2013, 48(09): 29-34.
[14] ZHANG Fang-guo. Elliptic curves in cryptography: past, present and future… [J]. J4, 2013, 48(05): 1-13.
[15] JU Chun-fei1, QIU Xiao-tao2, WANG Bao-cang2,3. Fast public key cryptosystem based on matrix ring [J]. J4, 2012, 47(9): 56-59.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
Supported by Beijing Magtech Co.Ltd