Analysis and design of stream ciphers
Analysis and design of stream ciphers
Linear complexity and random sequences
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
The probabilistic theory of linear complexity
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Keystream sequences with a good linear complexity profile for every starting point
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Analysis of the Berlekamp-Massey linear feedback shift-register synthesis algorithm
IBM Journal of Research and Development
Sequences with almost perfect linear complexity profile
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
An Approximate Distribution for the Maximum Order Complexity
Designs, Codes and Cryptography
Enumeration results on linear complexity profiles and lattice profiles
Journal of Complexity
TestU01: A C library for empirical testing of random number generators
ACM Transactions on Mathematical Software (TOMS)
Enumeration results on linear complexity profiles and lattice profiles
Journal of Complexity
Enumeration results on the joint linear complexity of multisequences
Finite Fields and Their Applications
| Hi-index | 0.00 |
We study the linear complexity profile and the jump complexity of keystream sequences in arbitrary finite fields. We solve counting problems connected with the jump complexity, establish formulas for the expected value and the variance of the jump complexity, and prove probabilistic theorems on the jump complexity profile of random sequences. We also extend earlier work on frequency distributions in the linear complexity profile to joint frequency distributions.