Please use this identifier to cite or link to this item:
https://doi.org/10.1016/j.jco.2006.10.005
| Title: | Error linear complexity measures for multisequences | Authors: | Meidl, W. Niederreiter, H. Venkateswarlu, A. |
Keywords: | Error linear complexity Joint linear complexity Multisequences Stream ciphers |
Issue Date: | Apr-2007 | Citation: | Meidl, W., Niederreiter, H., Venkateswarlu, A. (2007-04). Error linear complexity measures for multisequences. Journal of Complexity 23 (2) : 169-192. ScholarBank@NUS Repository. https://doi.org/10.1016/j.jco.2006.10.005 | Abstract: | Complexity measures for sequences over finite fields, such as the linear complexity and the k-error linear complexity, play an important role in cryptology. Recent developments in stream ciphers point towards an interest in word-based stream ciphers, which require the study of the complexity of multisequences. We introduce various options for error linear complexity measures for multisequences. For finite multisequences as well as for periodic multisequences with prime period, we present formulas for the number of multisequences with given error linear complexity for several cases, and we present lower bounds for the expected error linear complexity. © 2007 Elsevier Inc. All rights reserved. | Source Title: | Journal of Complexity | URI: | http://scholarbank.nus.edu.sg/handle/10635/103207 | ISSN: | 0885064X | DOI: | 10.1016/j.jco.2006.10.005 |
| 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.