FCSR PERIODIC MULTISEQUENCES WITH MAXIMAL JOINT N-ADIC COMPLEXITY AND LARGE k-ERROR JOINT N-ADIC COMPLEXITY OVER Z/(N)  

作　　者：LI Fulin HU Honggang ZHU Shixin 

机构地区：[1]Department of Applied Mathematics, Hefei University of Technology [2]School of Information Science and Technology, University of Science and Technology of China

出　　处：《Journal of Systems Science & Complexity》2014年第2期370-381,共12页系统科学与复杂性学报（英文版）

基　　金：supported by the National Natural Science Foundation of China under Grant Nos.61271271 and 61370089;100 Talents Program of Chinese Academy of Science;the Fundamental Research Funds for the Central Universities under Grant No.2012HGBZ0622

摘　　要：Complexity measures for keystream multisequences over Z/(N) play a crucial role in designing good stream cipher systems. This correspondence shows a general upper bound on k-error joint N-adic complexity of periodic multisequences over Z/(N), and establishes the existence of periodic N-adic multisequences over Z/(N) which simultaneously possess maximal joint N-adic complexity and large k-error joint N-adic complexity. Under some conditions the overwhelming majority of all T-periodic N-adic multisequences over Z/(N) with maximal joint N-adic complexity logN(NT- 1)have a k-error joint N-adic complexity close to logN(NT- 1).

关 键 词：Cryptography N-adic numbers joint N-adie complexity k-error joint N-adic complexity stream cipher. 

分 类 号：TN918.1[电子电信—通信与信息系统]