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

检索结果分析

结果分析中...
选择条件：
  • 期刊=Science China（Information Sciences）x
共 条 记 录，以下是1-6
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
On the k-error linear complexity of 2p2-periodic binary sequences
《Science China(Information Sciences)》2020年第9期253-255,共3页Zhihua NIU Can YUAN Zhixiong CHEN Xiaoni DU Tao ZHANG 
State Key Program of National Nature Science Foundation of China(Grant No.61936001);National Nature Science Foundation of Shanghai(Grant Nos.16ZR1411200,17ZR1409800,19ZR1417700);Research and Development Program in Key Areas of Guangdong Province(Grant No.2018B010113001);National Nature Science Foundation of China(Grant No.61572309);partially supported by National Natural Science Foundation of China(Grant No.61772292);partially supported by National Natural Science Foundation of China(Grant No.61772022);Projects of International Cooperation and Exchanges NSFC-RFBR(Grant No.61911530130)。
Dear editor,Pseudorandom sequences play an important role in cryptography.In particular in symmetric cryptography they serve as the secret key.So the designs of pseudorandom sequences and cryptographic indicators are ...
关键词：SEQUENCES PERIODIC DIRECTIONS 
Linear complexity problems of level sequences of Euler quotients and their related binary sequences被引量：3
《Science China(Information Sciences)》2016年第3期71-82,共12页Zhihua NIU Zhixiong CHEN Xiaoni DU 
partially supported by National Natural Science Foundation of China(Grant Nos.61272096;61202367);Shanghai Municipal Natural Science Foundation(Grant Nos.13ZR1416100;12ZR1443700);State Scholarship Fund of China Scholarship Council;Chen Z X was partially supported by National Natural Science Foundation of China(Grant Nos.61170246;61373140);State Scholarship Fund of China Scholarship Council;Du X N was partially supported by National Natural Science Foundation of China(Grants Nos.61202395;61462077);Program for New Century Excellent Talents in University(NCET-12-0620)
The Euler quotient modulo an odd-prime power pr （r 〉 1） can be uniquely decomposed as a p-adic number of the form （u（p- 1）Pr- 1 _ 1）/pr ≡- ao （u） ＋ a1 （u）p ＋... ＋at- 1 （u）Pr- 1 （mod pr）, gcd（u, p）...
关键词：CRYPTOGRAPHY Euler quotients Fermat quotients pseudorandom sequences binary sequences lin-ear complexity k-error linear complexity 
On the k-error linear complexity of binary sequences derived from polynomial quotients被引量：7
《Science China(Information Sciences)》2015年第9期79-93,共15页CHEN ZhiXiong NIU ZhiHua WU ChenHuang 
Chen Z X and Wu C H were supported by National Natural Science Foundation of China(Grant No.61373140);the Special Scientific Research Program in Fujian Province Universities of China(Grant No.JK2013044);Niu Z H was supported by National Natural Science Foundation of China(Grant Nos.61272096,61202395);Shanghai Municipal Natural Science Foundation(Grant Nos.13ZR1416100,12ZR1443700);Chen Z X and Niu Z H were also supported by the State Scholarship Fund of China Scholarship Council
The k-error linear complexity is an important cryptographic measure of pseudorandom sequences in stream ciphers. In this paper, we investigate the k-error linear complexity of p2-periodic binary sequences defined from...
关键词：CRYPTOGRAPHY Fermat quotients polynomial quotients binary sequences linear complexity k-error linear complexity 
Trace representation and linear complexity of binary sequences derived from Fermat quotients被引量：14
《Science China(Information Sciences)》2014年第11期116-125,共10页CHEN ZhiXiong 
supported by the National Natural Science Foundation of China(Grant Nos.61373140,61170246);the Special Scientific Research Program in Fujian Province Universities of China(Grant No.JK2013044)
We describe the trace representations of two families of binary sequences derived from the Fermat quotients modulo an odd prime p （one is the binary threshold sequences and the other is the Legendre Fermat quotient s...
关键词：Fermat quotients trace functions defining pairs binary sequences Legendre symbol linear complexity CRYPTOGRAPHY 
New application methods for word-oriented cryptographic primitives被引量：1
《Science China(Information Sciences)》2012年第9期2149-2160,共12页YANG Yang ZENG Guang JIN ChengHui QU YunYing 
supported by National Natural Science Foundation of China (Grant No. 61003291);National High Technology Research and Development Program of China (Grant No. 2011AA010803);Foundation for the Author of National Excellent Doctoral Dissertation of China (Grant No. FANEDD-2007B74)
Modern software oriented symmetric ciphers have become a key feature in utilizing word-oriented cryptographic primitives. Using the output sequence, in the order of its generation, of a word-oriented crypto- graphic p...
关键词：stream cipher single cycle T-function linear complexity k-error linear complexity 
Improved results on the probabilistic theory of the joint linear complexity of multisequences被引量：1
《Science China(Information Sciences)》2012年第1期165-170,共6页NIEDERREITER Harald VIELHABER Michael WANG LiPing 
supported by National High-Tech Research&Development Program of China(Grant No.2006AA-01Z420);National Natural Science Foundation of China(Grant No.10990011)
We improve previous results on the asymptotic behavior and the expected value of the joint linear complexity of random multisequences over finite fields. These results are of interest for word-based stream ciphers in ...
关键词：MULTISEQUENCES joint linear complexity stream ciphers 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部