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
The linear complexity profile and the jump complexity of keystream sequences
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Rational Points on Curves over Finite Fields: Theory and Applications
Rational Points on Curves over Finite Fields: Theory and Applications
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
Analysis of the Berlekamp-Massey linear feedback shift-register synthesis algorithm
IBM Journal of Research and Development
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
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
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
Joint linear complexity of arbitrary multisequences consisting of linear recurring sequences
Finite Fields and Their Applications
Lattice basis reduction algorithms and multi-dimensional continued fractions
Finite Fields and Their Applications
SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
| Hi-index | 0.06 |
Recent developments in stream ciphers point towards an interest in word-based or vectorized stream ciphers. Such stream ciphers suggest the study of the joint linear complexity of multisequences. In this paper, using the first author's multisequence linear feedback shift-register synthesis algorithm based on a lattice basis reduction algorithm in function fields, we present a method to determine the value of N"n^(^m^)(L), the number of m-fold multisequences of length n over a finite field F"q with nth joint linear complexity L. Furthermore, a closed-form expression for N"n^(^m^)(L) and formulas for the expected value of the joint linear complexity and its variance are given when m=2.