FCSR PERIODIC MULTISEQUENCES WITH MAXIMAL JOINT N-ADIC COMPLEXITY AND LARGE k-ERROR JOINT N-ADIC COMPLEXITY OVER Z/（N）-中国期刊网

摘要 ComplexitymeasuresforkeystreammultisequencesoverZ/(N)playacrucialroleindesigninggoodstreamciphersystems.Thiscorrespondenceshowsageneralupperboundonk-errorjointN-adiccomplexityofperiodicmultisequencesoverZ/(N),andestablishestheexistenceofperiodicN-adicmultisequencesoverZ/(N)whichsimultaneouslypossessmaximaljointN-adiccomplexityandlargek-errorjointN-adiccomplexity.UndersomeconditionstheoverwhelmingmajorityofallT-periodicN-adicmultisequencesoverZ/(N)withmaximaljointN-adiccomplexitylogN(NT-1)haveak-errorjointN-adiccomplexityclosetologN(NT-1).

1Zhu Fengxiang Qi Wenfeng. THE 2-ERROR LINEAR COMPLEXITY OF 2^n-PERIODIC BINARY SEQUENCES WITH LINEAR COMPLEXITY 2^n -1.物理电子学,2007-03.
2堵丁柱;KER-IKo. 0N THE COMPLEXITY OF AN OPTIMAL ROUTING TREE PROBLEM.基础数学,1989-01.
3Xi Xia Jin-chuan Cui. A Method of Estimating Computational Complexity Based on Input Conditions for N-vehicle Problem.基础数学,2010-01.
4. ON SET {N_k~-(x)}_k~n=0.基础数学,1996-02.
5尹建国. 关于cos(k/n)π,sin(k/n)π,tg(k/n)π无理性的讨论.会计学,1996-04.
6戴宗铎;黄民强. LINEAR COMPLEXITY AND THE MINIMAL POLYNOMIAL OF LINEAR RECURRING SEQUENCES OVER Z/(m).系统科学,1991-01.
7陈翰麟. ON n- WIDTHS OF PERIODIC FUNCTIONS.基础数学,1991-03.
8Zi Hong TIAN;Rui Zhong WEI. Decomposing Triples of Zp^n and Z3p^n into Cyclic Designs.基础数学,2013-11.
9. 幼苗和N、P、K.学前教育学,2000-03.
10XU Liqiong;GUO Xiaofeng. MINIMALLY （n, λ）-CONNECTED GRAPHS OF LOW ORDER AND MAXIMAL SIZE＊.系统科学,2005-04.

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

来源期刊

相关推荐

同分类资源更多

相关关键词

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

来源期刊

相关推荐

同分类资源 更多

相关关键词

同分类资源更多