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
Random number generation and quasi-Monte Carlo methods
Random number generation and quasi-Monte Carlo methods
Linear complexity profiles and jump complexity
Information Processing Letters
On distribution properties of sequences with perfect linear complexity profile
Information Processing Letters
Rational Points on Curves over Finite Fields: Theory and Applications
Rational Points on Curves over Finite Fields: Theory and Applications
Counting functions and expected values for the lattice profile at n
Finite Fields and Their Applications
| Hi-index | 0.00 |
We present enumeration results on the linear complexity profile and the related lattice profile, a complexity measure based on Marsaglia's lattice test, of sequences over finite fields. In particular, we calculate the number of sequences with prescribed profiles and analyze the increase frequency, that is the jump complexity analog for the lattice profile. Moreover, we provide some results on sequences with a k-almost perfect linear complexity profile respectively lattice profile. Finally, we present some distribution properties of binary sequences with length N and perfect lattice profile.