The Probabilistic Theory of Linear Complexity

DOI10.1007/3-540-45961-8_17zbMath0657.94009OpenAlexW1512922533MaRDI QIDQ3807118

Harald Niederreiter

Publication date: 1988

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45961-8_17

zbMATH Keywords

generating functionHaar measurelinear complexity profile for random sequencesrandomness tests for keystream sequences

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (27)

Jump and hop randomness tests for binary sequences ⋮ Pseudorandom sequences derived from automatic sequences ⋮ Hausdorff dimensions of bounded-type continued fraction sets of Laurent series ⋮ On the pseudorandomness of automatic sequences ⋮ On the relative growth rate of the product of consecutive partial quotients in continued fraction expansions of Laurent series ⋮ Hausdorff dimension of the recurrence sets of Gauss transformation on the field of Laurent series ⋮ An analogue of a theorem of Szüsz for formal Laurent series over finite fields. ⋮ The independence of two randomness properties of sequences over finite fields ⋮ Cantor sets determined by partial quotients of continued fractions of Laurent series ⋮ Kronecker-Halton sequences in \(\mathbb{F}_p((X^{-1}))\) ⋮ Metrical properties for the weighted sums of degrees of multiple partial quotients in continued fractions of Laurent series ⋮ On the Quantitative Metric Theory of Continued Fractions in Positive Characteristic ⋮ On sets of exact Diophantine approximation over the field of formal series ⋮ A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences ⋮ Beta-expansion and continued fraction expansion over formal Laurent series ⋮ Perfect linear complexity profile and apwenian sequences ⋮ On sums of degrees of the partial quotients in continued fraction expansions of Laurent series ⋮ Kurzweil type metrical Diophantine properties in the field of formal Laurent series ⋮ On metric Diophantine approximation in the field of formal Laurent series ⋮ Enumeration results on linear complexity profiles and lattice profiles ⋮ On the joint linear complexity profile of explicit inversive multisequences ⋮ Continued fraction for formal Laurent series and the lattice structure of sequences ⋮ Metrical properties for continued fractions of formal Laurent series ⋮ Enumeration results on the joint linear complexity of multisequences ⋮ Multidimensional linear complexity analysis of periodic arrays ⋮ The statistics of continued fractions for polynomials over a finite field ⋮ Counting functions and expected values for the lattice profile at \(n\)

This page was built for publication: The Probabilistic Theory of Linear Complexity