Meidl, Wilfried and Niederreiter, Harald and Venkateswarlu, Ayineedi (2007) Error linear complexity measures for multisequences. Journal of Complexity, 23 (2). pp. 169-192. ISSN 0885-064X
![[thumbnail of This is a RoMEO green publisher -- author can archive pre-print (ie pre-refereeing) and post-print (ie final draft post-refereeing)]](https://research.sabanciuniv.edu/style/images/fileicons/application_pdf.png)
PDF (This is a RoMEO green publisher -- author can archive pre-print (ie pre-refereeing) and post-print (ie final draft post-refereeing))
3011800000283.pdf
Download (221kB)
Official URL: http://dx.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.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | multisequences; joint linear complexity; error linear complexity; stream ciphers |
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Faculty of Engineering and Natural Sciences |
| Depositing User: | Wilfried Meidl |
| Date Deposited: | 17 Nov 2006 02:00 |
| Last Modified: | 26 Apr 2022 07:59 |
| URI: | https://research.sabanciuniv.edu/id/eprint/42 |
Actions (login required)
- View Item