MULTISEQUENCES

作品数：5被引量：2H指数：1
导出分析报告
相关领域：电子电信更多>>
相关期刊：《Chinese Journal of Electronics》《The Journal of China Universities of Posts and Telecommunications》《Science China(Information Sciences)》《Journal of Systems Science & Complexity》更多>>
相关基金：国家自然科学基金国家重点基础研究发展计划更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-5
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
On the matrix feedback shift register synthesis for matrix sequences
《Science China(Information Sciences)》2016年第3期83-92,共10页Liping WANG Guang ZENG 
supported by National Basic Research Program of China(973 Program)(Grant No.2013CB834203);National Natural Science Foundation of China(Grant Nos.61170289;61003291)
In this paper, a generalization of the linear feedback shift register synthesis problem is presented for synthesizing minimum-length matrix feedback shift registers （MFSRs for short） to generate prescribed matrix se...
关键词：Berlekamp-Massey algorithm minimal partial realization MULTISEQUENCES σ-LFSR 
FCSR PERIODIC MULTISEQUENCES WITH MAXIMAL JOINT N-ADIC COMPLEXITY AND LARGE k-ERROR JOINT N-ADIC COMPLEXITY OVER Z/(N)
《Journal of Systems Science & Complexity》2014年第2期370-381,共12页LI Fulin HU Honggang ZHU Shixin 
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 m...
关键词：Cryptography N-adic numbers joint N-adie complexity k-error joint N-adic complexity stream cipher. 
Computing the k-error joint linear complexity of binary periodic multisequences
《The Journal of China Universities of Posts and Telecommunications》2013年第6期96-101,共6页LI Fu-lin ZHU Shi-xin 
supported by the National Natural Science Foundation of China (61370089);the Fundamental Research Funds for the Central Universities (2012HGBZ0622)
Complexity measures for multisequences over finite fields, such as the joint linear complexity and the k-error joint linear complexity, play an important role in cryptology. In this paper we study a fast algorithm, pr...
关键词：CRYPTOLOGY multisequence algorithm joint linear complexity k-error joint 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 
On the Joint Nonlinear Span of Multiple Binary Sequence被引量：1
《Chinese Journal of Electronics》2007年第2期321-325,共5页DONG Lihua HU Yupu 
This work is supported by the National Natural Science Foundation of China （No. 60473029 and No. 60673072）.
Recent developments in stream ciphers show strong interests in word-based （or vectorized） stream ciphers. The theory of such stream ciphers required the study of the complexity of multisequences. In this paper the p...
关键词：CRYPTOGRAPHY Stream cipher Nonlinear span Multisequences. 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部