The expected value of the joint linear complexity of periodic multisequences

Authors:
Wilfried Meidl;Harald Niederreiter
Affiliations:
Institute of Discrete Mathematics, Austrian Academy of Sciences, Sonnenfelsgasse 19, A-1010 Vienna, Austria;Department of Mathematics, National University of Singapore, 2 Science Drive 2, Singapore 117543, Singapore
Venue:
Journal of Complexity
Year:
2003

Citing 6
Cited 21

Analysis and design of stream ciphers

Analysis and design of stream ciphers
Extension of the Berlekamp-Massey algorithm to N dimensions

Information and Computation
Multi-sequences with almost perfect linear complexity profile and function fields over finite fields

Journal of Complexity
Linear complexity, k-error linear complexity, and the discrete Fourier transform

Journal of Complexity
A Fourier Transform Approach to the Linear Complexity of Nonlinearly Filtered Sequences

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
On the expected value of the linear complexity and the k-error linear complexity of periodic sequences

IEEE Transactions on Information Theory

On the joint linear complexity profile of explicit inversive multisequences

Journal of Complexity
The expectation and variance of the joint linear complexity of random periodic multisequences

Journal of Complexity
Error linear complexity measures for multisequences

Journal of Complexity
On the counting function of the lattice profile of periodic sequences

Journal of Complexity
Reducing the calculation of the linear complexity of u2v-periodic binary sequences to Games---Chan algorithm

Designs, Codes and Cryptography
Periodic multisequences with large error linear complexity

Designs, Codes and Cryptography
Expected Π-Adic Security Measures of Sequences

SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
Generalized Joint Linear Complexity of Linear Recurring Multisequences

SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
Multisequences with large linear and k-error linear complexity from Hermitian function fields

IEEE Transactions on Information Theory
On the joint linear complexity profile of explicit inversive multisequences

Journal of Complexity
The expectation and variance of the joint linear complexity of random periodic multisequences

Journal of Complexity
Expected π-adic security measures of sequences

IEEE Transactions on Information Theory
The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence

Theoretical Computer Science
Proof of a conjecture on the joint linear complexity profile of multisequences

INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Discrete fourier transform, joint linear complexity and generalized joint linear complexity of multisequences

SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Expected value of the linear complexity of two-dimensional binary sequences

SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
The probabilistic theory of the joint linear complexity of multisequences

SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
On the expected value of the joint 2-adic complexity of periodic binary multisequences

SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
The minimal polynomial over Fq of linear recurring sequence over Fqm

Finite Fields and Their Applications
Improved results on periodic multisequences with large error linear complexity

Finite Fields and Their Applications
Joint linear complexity of arbitrary multisequences consisting of linear recurring sequences

Finite Fields and Their Applications

Quantified Score

Hi-index	0.12

Visualization

Abstract

Complexity measures for sequences of elements of a finite field, such as the linear complexity, play an important role in cryptology. Recent developments in stream ciphers point towards an interest in word-based (or vectorized) stream ciphers, which require the study of the complexity of multisequences. We extend a well-known relationship between the linear complexity of an N-periodic sequence and the (generalized) discrete Fourier transform of N- tuples to the case of multisequences. Using the concept of the generalized discrete Fourier transform for multisequences, we compute the expected value of the joint linear complexity of random periodic multisequences, and for some types of period lengths N we determine the number NNt(c) of t N-periodic sequences with given joint linear complexity c.