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
Proof of Massey's conjectured algorithm
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Extension of the Berlekamp-Massey algorithm to N dimensions
Information and Computation
Rational Points on Curves over Finite Fields: Theory and Applications
Rational Points on Curves over Finite Fields: Theory and Applications
Linear Complexity of Periodic Sequences: A General Theory
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
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
Analysis of the Berlekamp-Massey linear feedback shift-register synthesis algorithm
IBM Journal of Research and Development
On the joint linear complexity profile of explicit inversive multisequences
Journal of Complexity
Linear complexity of periodically repeated random sequences
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Sequences with almost perfect linear complexity profile
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Proof of a conjecture on the joint linear complexity profile of multisequences
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
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
Multi-continued fraction algorithm and generalized B-M algorithm over F2
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
On the lattice basis reduction multisequence synthesis algorithm
IEEE Transactions on Information Theory
Enumeration results on the joint linear complexity of multisequences
Finite Fields and Their Applications
Finite Fields and Their Applications
Error linear complexity measures for 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 minimal polynomial over Fq of linear recurring sequence over Fqm
Finite Fields and Their Applications
| Hi-index | 0.06 |
The joint linear complexity and the joint linear complexity profile are standard complexity measures for multisequences in the context of word-based stream ciphers. The last few years have seen major advances in the theory of these complexity measures, especially with regard to probabilistic results on the behavior of random (periodic and nonperiodic) multisequences. This paper presents a survey of these developments as well as the necessary background for the results.