AbstractWe 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
AbstractComplexity measures for sequences over finite fields, such as the linear complexity and the ...
The joint linear complexity of multisequences is an important security measure for vectorized stream...
Let g(1),..., g(s) is an element of F-q[x] be arbitrary nonconstant monic polynomials. Let M(g(1),.....
AbstractWe prove lower bounds on the joint linear complexity profile of multisequences obtained by e...
Recently, multisequences have gained increasing interest for applications in cryptography and quasi-...
AbstractLinear complexity and linear complexity profile are interesting characteristics of a sequenc...
AbstractIn this paper we use the successive minima profile to measure structural properties of pseud...
10.1007/11596219_2Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial...
The linear complexity of sequences is one of the important security measures for stream cipher syste...
AbstractIn this paper, we construct multisequences with both large (joint) linear complexity and k-e...
AbstractComplexity measures for sequences over finite fields, such as the linear complexity and the ...
AbstractFor multisequences there are various possibilities of defining analogs of the k-error linear...
AbstractWe present enumeration results on the linear complexity profile and the related lattice prof...
Complexity measures for sequences over finite fields, such as the linear complexity and the k-error ...
AbstractRecent developments in stream ciphers point towards an interest in word-based or vectorized ...
AbstractComplexity measures for sequences over finite fields, such as the linear complexity and the ...
The joint linear complexity of multisequences is an important security measure for vectorized stream...
Let g(1),..., g(s) is an element of F-q[x] be arbitrary nonconstant monic polynomials. Let M(g(1),.....
AbstractWe prove lower bounds on the joint linear complexity profile of multisequences obtained by e...
Recently, multisequences have gained increasing interest for applications in cryptography and quasi-...
AbstractLinear complexity and linear complexity profile are interesting characteristics of a sequenc...
AbstractIn this paper we use the successive minima profile to measure structural properties of pseud...
10.1007/11596219_2Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial...
The linear complexity of sequences is one of the important security measures for stream cipher syste...
AbstractIn this paper, we construct multisequences with both large (joint) linear complexity and k-e...
AbstractComplexity measures for sequences over finite fields, such as the linear complexity and the ...
AbstractFor multisequences there are various possibilities of defining analogs of the k-error linear...
AbstractWe present enumeration results on the linear complexity profile and the related lattice prof...
Complexity measures for sequences over finite fields, such as the linear complexity and the k-error ...
AbstractRecent developments in stream ciphers point towards an interest in word-based or vectorized ...
AbstractComplexity measures for sequences over finite fields, such as the linear complexity and the ...
The joint linear complexity of multisequences is an important security measure for vectorized stream...
Let g(1),..., g(s) is an element of F-q[x] be arbitrary nonconstant monic polynomials. Let M(g(1),.....
DOI
Add to ORKG