Please use this identifier to cite or link to this item:
https://doi.org/10.1007/11596219_2
| Title: | Proof of a conjecture on the joint linear complexity profile of multisequences | Authors: | Niederreiter, H. Wang, L.-P. |
Keywords: | Joint linear complexity Joint linear complexity profile Multisequences Word-based stream ciphers |
Issue Date: | 2005 | Citation: | Niederreiter, H.,Wang, L.-P. (2005). Proof of a conjecture on the joint linear complexity profile of multisequences. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3797 LNCS : 13-22. ScholarBank@NUS Repository. https://doi.org/10.1007/11596219_2 | Abstract: | We prove a conjecture on the asymptotic behavior of the joint linear complexity profile of random multisequences over a finite field. This conjecture was previously shown only in the special cases of single sequences and pairs of sequences, We also establish an asymptotic formula for the expected value of the nth joint linear complexity of random multisequences over a finite field. These results are relevant for the theory of word-based stream ciphers. © Springer-Verlag Berlin Heidelberg 2005. | Source Title: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | URI: | http://scholarbank.nus.edu.sg/handle/10635/104613 | ISBN: | 3540308059 | ISSN: | 03029743 | DOI: | 10.1007/11596219_2 |
| Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.