LINEAR_COMPLEXITY

作品数：53被引量：78H指数：5
导出分析报告
相关作者：胡卫群岳勤更多>>
相关机构：南京航空航天大学南京林业大学更多>>
相关期刊：《The Journal of China Universities of Posts and Telecommunications》《Progress in Natural Science:Materials International》《Frontiers of Mathematics in China》《Journal of Southeast University(English Edition)》更多>>
相关基金：国家自然科学基金福建省自然科学基金国家重点基础研究发展计划国家教育部博士点基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 期刊=Chinese Journal of Electronicsx
共 条 记 录，以下是1-10
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
On the Linear Complexity of a Class of Periodic Sequences Derived from Euler Quotients
《Chinese Journal of Electronics》2023年第2期262-272,共11页LUO Bingyu ZHANG Jingwei ZHAO Chang’an 
supported by Guangdong Major Project of Basic and Applied Basic Research(2019B030302008);the National Natural Science Foundation of China(61972428);the Open Fund of State Key Laboratory of Information Security(Institute of Information Engineering,Chinese Academy of Sciences)(2020-ZD-02);Guangdong Basic and Applied Basic Research Foundation(2019A1515011797).
In this paper,a family of binary sequences derived from Euler quotients with RSA modulus pq is introduced.Here two primes p and q are distinct and satisfy gcd(pq,(p−1)(q−1))=1.The linear complexities and minimal polyn...
关键词：CRYPTOGRAPHY Binary sequences Linear complexity Euler quotients RSA modulus 
Multiscale ApEn and SampEn in Quantifying Nonlinear Complexity of Depressed MEG被引量：2
《Chinese Journal of Electronics》2019年第4期817-821,共5页YAO Wenpo HU Hui WANG Jun YAN Wei LI Jin HOU Fengzhen 
supported by the National Natural Science Foundation of China(No.61271082,No.61401518,No.31671006,No.61771251);Jiangsu Provincial Key R&D Program(Social Development)(No.BE2015700,No.BE2016773);the Natural Science Foundation of Jiangsu Province(No.BK20141432);Natural Science Research Major Program in Universities of Jiangsu Province(No.16KJA310002);Postgraduate Research&Practice Innovation Program of Jiangsu Province(No.KYCX17-0788)
Depression is a neurophysiological disorder with recurrent dysregulations of self-mental states.Multiscale Approximate entropy(ApEn)and Sample entropy(SampEn)are employed to characterize nonlinear complexity of Magnet...
关键词：MAGNETOENCEPHALOGRAPHY DEPRESSION Approximate ENTROPY Sample ENTROPY Multiscale 
Linear Complexity of d-Ary Sequence Derived from Euler Quotients over GF(q)被引量：1
《Chinese Journal of Electronics》2019年第3期529-534,共6页YE Zhifan KE Pinhui CHEN Zhixiong 
supported by the National Natural Science Foundation of China (No.61772292, No.61772476);the Provincial Natural Science Foundation of Fujian (No.2019J01273);the Foundation of FujianEducational Committee (No.JAT170627)
For an odd prime p and positive integers r,d such that 0
关键词：Linear complexity EULER QUOTIENT d-ary SEQUENCE 
Linear Complexity of Least Significant Bit of Polynomial Quotients被引量：2
《Chinese Journal of Electronics》2017年第3期573-578,共6页ZHAO Chun'e MA Wenping YAN Tongjiang SUN Yuhua 
supported by the National Natural Science Foundation of China(No.61170319,No.61072140,No.61373171);the 111 Project(No.B08038);the Specialized Research Fund for the Doctoral Program of Higher Education(No.20100203110003);the Fujian Provincial Key Laboratory of Network Security and Cryptology Research Fund(Fujian Normal University)(No.15002);the Shandong Provincial Natural Science Foundation of China(No.ZR2014FQ005);the Fundamental Research Funds for the Central Universities(No.15CX08011A,No.15CX02065A,No.15CX02060A,No.15CX05060A,No.16CX02013A);the Applied Basic Research Program of Qingdao(No.16-5-1-5-jch)
Binary sequences with large linear complexity have been found many applications in communication systems.We determine the linear complexity of a family of p^2-periodic binary sequences derived from polynomial quotient...
关键词：CRYPTOGRAPHY Polynomial quotient Fermat quotient Pseudo-random sequences Linear complexity 
On the Error Linear Complexity Spectrum of Binary Sequences with Period of Power of Two被引量：3
《Chinese Journal of Electronics》2015年第2期366-372,共7页CHANG Zuling KE Pinhui 
supported by the Joint Funds of National Natural ScienceFoundation of China(No.U1304604,No.61102093);the Natural Science Foundation of Education Department of Henan Province(No.14A110022)
The properties of error linear complexity of binary sequences with period of power of two are studied in this paper. Using the Games-Chan algorithm as main tool, accurate formulas of the minimum value k for which the ...
关键词：Binary SEQUENCES Games-Chan algorithm ERROR linear complexity SPECTRUM 
On the First and Second Critical Error Linear Complexity of Binary 2^n-periodic Sequences被引量：2
《Chinese Journal of Electronics》2013年第1期1-6,共6页CHANG Zuling WANG Xueyuan 
This work is supported by the National Natural Science Foundation of China （No.61174085, No.61170270, No.61121061）.
This paper studies the error linear com-plexity of binary sequences with period 2^n. One new rep-resentation of binary sequences with period 2^n and new interpretation of Games-Chan algorithm are given. New properties...
关键词：Sequence Games-Chan algorithm Lin-ear complexity Error linear complexity. 
Improving the Lower Bound on Linear Complexity of the Sequences Generated by Ndnlinear Filtering被引量：1
《Chinese Journal of Electronics》2012年第3期519-522,共4页ZHANG Yin LIN Dongdai LIU Meicheng 
Manuscript Received Mar. 2011; Accepted Nov. 2011. This work is supported by the National Basic Research Program of China （973 Program） （No.2011CB302400）, the National Natural Science Foundation of China （No.60970152, No.61173134）, the Grand Project of Institute of Software （No.YOCX285056） and the CAS Special Grant for Postgraduate Research, Innovation and Practice.
Linear complexity is an important prop- erty for secure keystream sequences. In this paper, we study binary sequences generated by nonlinear filters on u-sequences with the method of Discrete Fourier trans- form （DFT...
关键词：Linear feedback shift register （LFSR） u-sequence Linear complexity Discrete Fourier transformDFT） Equidistant filter Spectral immunity. 
On the Cryptographic Properties of Binary 2n-periodic Sequences被引量：6
《Chinese Journal of Electronics》2011年第2期307-311,共5页CHANG Zuling WEN Qiaoyan 
This work is supported by the National Natural Science Foundation of China （No.60873191, No.60821001）.
New properties and methods about the linear complexity and the k-error linear complexity of binary 2n-periodic sequences are provided. Using Games-Chan algorithm and new method, we give some new results about k-error ...
关键词：SEQUENCE Games-Chan algorithm Linear complexity k-error linear complexity Critical error sequence. 
Trace Representations of Generalized Cyclotomic Sequences of Length pq with Arbitrary Order被引量：4
《Chinese Journal of Electronics》2009年第3期460-464,共5页DU Xiaoni CHEN Zhixiong 
This work is supported by the National Natural Science Foundation of China （No.60603010）, the Key Project of Chinese Ministry of Education （No.208148） and Gansu Natural Science Foundation （No.0903RJZA107）.
The constructions of two main classes of generalized cyclotomic binary sequences of length pq with arbitrary order are presented by using generalized cyclotomic classes in the sense of Whiteman and of Ding- Helleseth....
关键词：Stream ciphers Generalized cyclotomic sequences Binary sequences Trace function Linear complexity. 
The 2-error Linear Complexity of 2n-Periodic Binary Sequences被引量：2
《Chinese Journal of Electronics》2008年第2期356-360,共5页ZHU Fengxiang QI Wenfeng 
This work is supported by the National Natural Science Foundation of China （No.60673081） and the National High Technology Research and Development 863 Program of China （No.2006AA01Z417）.
Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of key sequences. For a random 2n-periodic binary sequence, the number of sequences with given ...
关键词：Linear complexity k-error linear complexity Periodic binary sequences Expect. 
全选清除导出
共2页<12>
检索报告 对象比较 聚类工具 使用帮助 返回顶部