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)》更多>>
相关基金：国家自然科学基金福建省自然科学基金国家重点基础研究发展计划国家教育部博士点基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 期刊=The Journal of China Universities of Posts and Telecommunicationsx
共 条 记 录，以下是1-3
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
Linear complexity of quaternary sequences with odd period and low autocorrelation被引量：3
《The Journal of China Universities of Posts and Telecommunications》2014年第5期89-93,共5页KE Pin-hui LIN Chang-lu ZHANG Sheng-yuan 
supported by the National Natural Science Foundation of China (61102093);the Joint Funds of the National Natural Science Foundation of China (U1304604);the Fujian Normal University Innovative Research Team (IRTL 1207)
Equivalence between two classes of quaternary sequences with odd period and best known autocorrelation are proved. A lower bound on the linear complexity of these sequences is presented. It is shown that the quaternar...
关键词：quaternary sequences linear complexity CYCLOTOMY 
Linear complexity of sequences produced by single cycle T-function
《The Journal of China Universities of Posts and Telecommunications》2011年第4期123-128,共6页WANG Yan HU Yu-pu LI Shun-bo YANG Yang 
supported by the National Natural Science Foundation of China (60833008,60803149);the Scientific Research Foundation of Education Department of Shaanxi Provincial Government of China (11JK0503);the Youth Science and Technology Foundation of Xi’an University of Architecture and Technology (QN0831,QN1024)
Four kinds of sequences generated by single cycle triangular function （T-function） are investigated to check the possibility for a single cycle T-function to be a cryptographic component in stream ciphers. Based on ...
关键词：stream cipher single cycle T-function linear complexity 
On GF(p)-linear complexities of binary sequences被引量：1
《The Journal of China Universities of Posts and Telecommunications》2009年第4期112-115,124,共5页XU Li-qing 
supported by the National Natural Science Foundation of China (10871068)
Several geometric sequences have very low linear complexities when considered as sequences over GF（p）, such as the binary sequences of period q^n - 1 constructed by Chan and Games [1-2] （q is a prime power p^m, p i...
关键词：CRYPTOGRAPHY stream cipher binary sequences GF（2） linear complexity GF（p）-linear complexity 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部