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
Extension of the Berlekamp-Massey algorithm to N dimensions
Information and Computation
Random number generation and quasi-Monte Carlo methods
Random number generation and quasi-Monte Carlo methods
On a new class of pseudorandom numbers for simulation methods
Journal of Computational and Applied Mathematics
On the linear complexity profile of explicit nonlinear pseudorandom numbers
Information Processing Letters
The expected value of the joint linear complexity of periodic multisequences
Journal of Complexity
On the linear complexity profile of some new explicit inversive pseudorandom numbers
Journal of Complexity - Special issue on coding and cryptography
Shift-register synthesis and BCH decoding
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Proof of a conjecture on the joint linear complexity profile of multisequences
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
The probabilistic theory of the joint linear complexity of multisequences
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
Hi-index | 0.00 |
We prove lower bounds on the joint linear complexity profile of multisequences obtained by explicit inversive methods and show that for some suitable choices of parameters these joint linear complexity profiles are close to be perfect.