Information Theory and Reliable Communication
Information Theory and Reliable Communication
Discrete logarithms in finite fields and their cryptographic significance
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
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
Efficient parallel factorization and solution of structured and unstructured linear systems
Journal of Computer and System Sciences
Asymptotic analysis on the normalized k-error linear complexity of binary sequences
Designs, Codes and Cryptography
The probabilistic theory of the joint linear complexity of multisequences
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Enumeration results on the joint linear complexity of multisequences
Finite Fields and Their Applications
Counting functions and expected values for the lattice profile at n
Finite Fields and Their Applications
Counting Functions and Expected Values for the k-Error Linear Complexity
Finite Fields and Their Applications
| Hi-index | 0.00 |
An analysis of the Berlekamp-Massey Linear Feedback Shift-Register (LFSR) Synthesis Algorithm is provided which shows that an input string of length n requires O(n2) multiplication/addition operations in the underlying field of definition. We also derive the length distribution for digit strings of length n. Results show that, on the average, the encoded length is no greater than n + 1. Furthermore, we exhibit a connection between step 1 of the Ling-Palermo algorithm and the LFSR Algorithm, and the LFSR Algorithm turns out to be computationally superior.