Proof of a conjecture on the joint linear complexity profile of multisequences

Authors:
Harald Niederreiter;Li-Ping Wang
Affiliations:
Department of Mathematics, National University of Singapore, Singapore, Republic of Singapore;Temasek Laboratories, National University of Singapore, Singapore, Republic of Singapore
Venue:
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Year:
2005

Citing 14
Cited 8

Analysis and design of stream ciphers

Analysis and design of stream ciphers
The probabilistic theory of linear complexity

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Multi-sequences with almost perfect linear complexity profile and function fields over finite fields

Journal of Complexity
A Class of Explicit Perfect Multi-sequences

ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Exploiting Multiples of the Connection Polynomial in Word-Oriented Stream Ciphers

ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Fast Hashing and Stream Encryption with PANAMA

FSE '98 Proceedings of the 5th International Workshop on Fast Software Encryption
The expected value of the joint linear complexity of periodic multisequences

Journal of Complexity
Multi-sequences with d-perfect property

Journal of Complexity
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
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
Asymptotic behavior of normalized linear complexity of multi-sequences

SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
On the lattice basis reduction multisequence synthesis algorithm

IEEE Transactions on Information Theory

Error linear complexity measures for multisequences

Journal of Complexity
The asymptotic normalized linear complexity of multisequences

Journal of Complexity
Periodic multisequences with large error linear complexity

Designs, Codes and Cryptography
Multisequences with large linear and k-error linear complexity from Hermitian function fields

IEEE Transactions on Information Theory
The probabilistic theory of the joint linear complexity of multisequences

SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Multi-continued fraction algorithms and their applications to sequences

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

Quantified Score

Hi-index	0.06

Visualization

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.