AbstractIn this paper we use the successive minima profile to measure structural properties of pseudorandom multisequences. We show that both the lattice profile and the joint linear complexity profile of a multisequence can be expressed in terms of the successive minima profile
AbstractLinear complexity and linear complexity profile are important characteristics of a sequence ...
One of the main contributions which Harald Niederreiter made to mathematics is related to pseudorand...
AbstractWe present enumeration results on the linear complexity profile and the related lattice prof...
AbstractIn this paper we use the successive minima profile to measure structural properties of pseud...
Recently, multisequences have gained increasing interest for applications in cryptography and quasi-...
AbstractWe present enumeration results on the linear complexity profile and the related lattice prof...
AbstractWe prove lower bounds on the joint linear complexity profile of multisequences obtained by e...
AbstractThe lattice profile analyzes the intrinsic structure of pseudorandom number sequences with a...
AbstractWe estimate the linear complexity profile of m-ary sequences in terms of their correlation m...
International audienceIn the last 15 years a new constructive theory of pseudorandomness of binary s...
AbstractLinear complexity and linear complexity profile are interesting characteristics of a sequenc...
International audienceIn Part I of this paper we extended the notions of family complexity, collisio...
International audienceLinear complexity is an important and frequently used measure of unpredictabil...
10.1007/11596219_2Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial...
10.1007/s00200-003-0116-6Applicable Algebra in Engineering, Communications and Computing136499-508AA...
AbstractLinear complexity and linear complexity profile are important characteristics of a sequence ...
One of the main contributions which Harald Niederreiter made to mathematics is related to pseudorand...
AbstractWe present enumeration results on the linear complexity profile and the related lattice prof...
AbstractIn this paper we use the successive minima profile to measure structural properties of pseud...
Recently, multisequences have gained increasing interest for applications in cryptography and quasi-...
AbstractWe present enumeration results on the linear complexity profile and the related lattice prof...
AbstractWe prove lower bounds on the joint linear complexity profile of multisequences obtained by e...
AbstractThe lattice profile analyzes the intrinsic structure of pseudorandom number sequences with a...
AbstractWe estimate the linear complexity profile of m-ary sequences in terms of their correlation m...
International audienceIn the last 15 years a new constructive theory of pseudorandomness of binary s...
AbstractLinear complexity and linear complexity profile are interesting characteristics of a sequenc...
International audienceIn Part I of this paper we extended the notions of family complexity, collisio...
International audienceLinear complexity is an important and frequently used measure of unpredictabil...
10.1007/11596219_2Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial...
10.1007/s00200-003-0116-6Applicable Algebra in Engineering, Communications and Computing136499-508AA...
AbstractLinear complexity and linear complexity profile are important characteristics of a sequence ...
One of the main contributions which Harald Niederreiter made to mathematics is related to pseudorand...
AbstractWe present enumeration results on the linear complexity profile and the related lattice prof...
DOI
Add to ORKG