首页 | 本学科首页   官方微博 | 高级检索  
     检索      

Statistical Characteristics of the Complexity for Prime-Periodic Sequences
作者姓名:NIUZhi-hua  LINai-cheng  XIAOGuo-zhen
作者单位:[1]NationalKeyLabofIntegratedServiceNetworks,XidianUniversity.Xi'an710071,Shannxi,China [2]SchoolofScience,Xi'anJiaotongUniversity,Xi'an710071,Shaanxi,China
基金项目:SupportedbytheNationalNaturalScienceFoundationofChina(60073051,90104005)
摘    要:Using the fact that the factorization of x^N-1 over GF(2) is especially explicit, we completely establish the distributions and the expected values of the linear complexity and the k-error linear complexity of the N-periodic sequences respectively, where N is an odd prime and 2 is a primitive root modulo N. The results show that there are a large percentage of sequences with both the linear complexity and the k-error linear complexity not less than N, quite close to their maximum possible values.

关 键 词:流密码  周期序列  k-误差线性复杂性  密码址
收稿时间:30 May 2004

Statistical characteristics of the complexity for prime-periodic sequences
NIUZhi-hua LINai-cheng XIAOGuo-zhen.Statistical Characteristics of the Complexity for Prime-Periodic Sequences[J].Wuhan University Journal of Natural Sciences,2005,10(1):211-213.
Authors:Niu Zhi-hua  Li Nai-cheng  Xiao Guo-zhen
Institution:(1) National Key Lab of Integrated Service Networks, Xidian University, 710071, Shannxi Xi'an, China;(2) School of Science, Xi'an Jiaotong University, 710071, Shaanxi Xi'an, China
Abstract:Using the fact that the factorization ofx N−1 over GF(2) is especially explicit, we completely establish the distributions and the expected values of the linear comlexity and thek-error linear complexity of theN-periodic sequences respectively, whereN is an odd prime and 2 is a primitive root moduloN. The results show that there are a large percentage of sequences with both the linear complexity and thek-error linear complexity not less thanN, quite close to their maximum possible values. Foundation item: Supported by the National Natural Science Foundation of China (60073051, 90104005) Biography: NIU Zhi-hua (1976-), female, Ph.D candidate, research direction: eryptography and information security.
Keywords:stream ciphers  periodic sequences  linear complexity  k-error linear complexity
本文献已被 维普 万方数据 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号