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


Computing the k-error joint linear complexity of binary periodic multisequences
Authors:LI  Fu-lin ZHU  Shi-xin
Affiliation:School of Mathematics, Hefei University of Technology, Hefei 230009, China
Abstract:
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, presented by Venkateswarlu A, to computer the k-error joint linear complexity of a binary periodic multisequence. In this paper, the aim is mainly to complement the theoretical derivation and proof of the existing algorithm. Moreover, our algorithm reduces computation.
Keywords:cryptology   multisequence   algorithm   joint linear complexity   k-error joint linear complexity
本文献已被 维普 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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