Please use this identifier to cite or link to this item:
Title: Enumeration results on the joint linear complexity of multisequences
Authors: Wang, L.-P.
Niederreiter, H. 
Keywords: Joint linear complexity
Lattice basis reduction algorithm
Multisequence shift-register synthesis
Issue Date: Nov-2006
Citation: Wang, L.-P., Niederreiter, H. (2006-11). Enumeration results on the joint linear complexity of multisequences. Finite Fields and their Applications 12 (4) : 613-637. ScholarBank@NUS Repository.
Abstract: Recent developments in stream ciphers point towards an interest in word-based or vectorized stream ciphers. Such stream ciphers suggest the study of the joint linear complexity of multisequences. In this paper, using the first author's multisequence linear feedback shift-register synthesis algorithm based on a lattice basis reduction algorithm in function fields, we present a method to determine the value of Nn (m) (L), the number of m-fold multisequences of length n over a finite field Fq with nth joint linear complexity L. Furthermore, a closed-form expression for Nn (m) (L) and formulas for the expected value of the joint linear complexity and its variance are given when m = 2. © 2005 Elsevier Inc. All rights reserved.
Source Title: Finite Fields and their Applications
ISSN: 10715797
DOI: 10.1016/j.ffa.2005.03.005
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Feb 20, 2019


checked on Feb 20, 2019

Page view(s)

checked on Feb 8, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.