[1] Graham S,Shparlinski I.On RSA moduli with almost half of the bits prescribed[J].Discrete Applied Mathematics,2008,156(16):3150-3154.
[2] Shparlinski I.On the uniformity of distribution of the RSA pairs[J].Mathematics of Computation,2001,70(234):801-808.
[3] Shparlinski I.On RSA moduli with prescribed bit patterns[J].Designs,Codes and Cryptography,2006,39(1):113-122.
[4] Whiteman A.A family of difference sets[J].Illinois Journal of Mathematics,1962,6:107-121.
[5] Bai E,Fu X,Xiao G.On the linear complexity of generalized cyclotomic sequences of order four over Zpq[J].IEICE Transactions on Fundamentals of Electronics,Communications and Computer Sciences,2005,88:392-395.
[6] Bai E,Liu X,Xiao G.Linear complexity of new generalized cyclotomic sequences of order two of length pq[J].IEEE Transactions on Information Theory,2005,51:1849-1853.
[7] 常祖领,周玉倩,柯品惠.一类新的pqr长2阶广义分圆序列的线性复杂度[J].电子学报,2015,43(1):166-170. Chang Zuling,Zhou Yuqian,Ke Pinhui.Linear complexity of new generalized cyclotomic sequences of order two and length pqr[J].Acta Electronica Sinica,2015,43(1):166-170.(in Chinese)
[8] Ding C.Linear complexity of generalized cyclotomic binary sequences of order 2[J].Finite Fields and Their Applications,1997,3:159-174.
[9] Ding C.Autocorrelation values of generalized cyclotomic sequences of order two[J].IEEE Transactions on Information Theory,1998,44:1699-1702.
[10] Ding C.Cyclotomic constructions of cyclic codes with length being the product of two primes[J].IEEE Transactions on Information Theory,2012,58(4):2231-2236.
[11] Du X,Yan T,Xiao G.Trace representation of some generalized cyclotomic sequences of length pq[J].Information Sciences,2008,178(16):3307-3316.
[12] 柯品惠,李瑞芳,张胜元.一类新的周期为pm+1qn+1的二元广义分圆序列的线性复杂度[J].电子学报,2014,42(5):1009-1013. Ke Pinhui,Li Ruifang,Zhang Shengyuan.The linear complexity of a new class of generalized cyclotomic binary sequences of length pm+1qn+1[J].Acta Electronica Sinica,2014,42(5):1009-1013.(in Chinese)
[13] Li S,Chen Z,Sun R,et al.On the randomness of generalized cyclotomic sequences of order two and length pq[J].IEICE Transactions on Fundamentals of Electronics,Communications and Computer Sciences,2007,E90-A:2037-2041.
[14] 刘华宁,陈晓林.一类新的广义割圆序列的线性复杂度及其自相关值[J].数学学报,2019,62(2):233-246. Liu Huaning,Chen Xiaolin.Autocorrelation values and linear complexity of new generalized cyclotomic sequences[J].Acta Mathematica Sinica Chinese Series,2019,62(2):233-246.(in Chinese)
[15] 刘龙飞,杨凯,杨晓元.新的周期为pm的GF(h)上广义割圆序列的线性复杂度[J].通信学报,2017,38(9):39-45. Liu Longfei,Yang Kai,Yang Xiaoyuan.On the linear complexity of a new generalized cyclotomic sequence with length pm over GF(h)[J].Journal on Communications,2017,38(9):39-45.(in Chinese)
[16] Qi M,Xiong S,Yuan J,et al.Trace representation over Fr of binary Jacobi sequences with period pq[J].IEICE Transactions on Fundamentals of Electronics,Communications and Computer Sciences,2015,98-A(3):912-917.
[17] Yan T,Du X,Xiao G,et al.Linear complexity of binary Whiteman generalized cyclotomic sequences of order 2k[J].Information Sciences,2009,179(7):1019-1023.
[18] Hu L,Yue Q.Autocorrelation value of Whiteman generalized cyclotomic sequence[J].Journal of Mathematical Research with Applications,2012,32(4):415-422.
[19] Hu L,Yue Q,Wang M.The linear complexity of Whiteman's generalized cyclotomic sequences of period pm+1qn+1[J].IEEE Transactions on Information Theory,2012,58(8):5534-5543.
[20] Dai Z,Gong G,Song H.A trace representation of binary Jacobi sequences[J].Discrete Mathematics,2009,309(6):1517-1527.
[21] 杜小妮,李芝霞,万韫琦,李晓丹.基于费马商的r元序列的迹表示[J].电子学报,2017,45(10):2439-2442. Du Xiaoni,Li Zhixia,Wan Yunqi,et al.Trace representation of r-ary sequences derived from Fermat quotients[J].Acta Electronica Sinica,2017,45(10):2439-2442.(in Chinese)
[22] Blahut R.Transform techniques for error control codes[J].IBM Journal of Research and Development,1979,23(3):299-315.
[23] Chen Z.Trace representation and linear complexity of binary sequences derived from Fermat quotients[J].SCIENCE CHINA Information Sciences,2014,57(11):1-10.
[24] Chen Z.Linear complexity and trace representation of quaternary sequences over Z 4 based on generalized cyclotomic classes modulo pq[J].Cryptography and Communications,2017,9(4):445-458.
[25] Chen Z,Du X,Marzouk R.Trace representation of pseudorandom binary sequences derived from Euler quotients[J].Applicable Algebra in Engineering,Communication and Computing,2015,26(6):555-570.
[26] Dai Z,Gong G,Song H,et al.Trace representation and linear complexity of binary e-th power residue sequences of period p[J].IEEE Transactions Information Theory,2011,57(3):1530-1547.
[27] Du X,Chen Z.Trace representation of binary generalized cyclotomic sequences with length pm[J].IEICE Transactions on Fundamentals of Electronics,Communications and Computer Sciences,2011,94-A(2):761-765.
[28] Du X,Chen Z,Shi A,et al.Trace representation of a new class of sextic residue sequences of period p=3(mod8)[J].IEICE Transactions,2009,92-A(2):668-670.
[29] Helleseth T,Kim S,No J.Linear complexity over Fp and trace representation of Lempel-Cohn-Eastman sequences[J].IEEE Transactions Information Theory,2003,49(6):1548-1552.
[30] Kim J,Song H.Trace representation of Legendre sequences[J].Designs,Codes and Cryptography,2001,24(3):343-348.
[31] No J,Lee H,Chung H,et al.Trace representation of Legendre sequences of Mersenne prime period[J].IEEE Transactions Information Theory,1996,42(6):2254-2255.
[32] Qi M,Xiong S,Yuan J,et al.A simpler trace representation of Legendre sequences[J].IEICE Transactions on Fundamentals of Electronics,Communications and Computer Sciences,2015,98-A(4):1026-1031. |