scientific article; zbMATH DE number 1740058
From MaRDI portal
Publication:4330647
zbMath1049.94013MaRDI QIDQ4330647
Publication date: 14 May 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorics on words (68R15) Cryptography (94A60) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Related Items (14)
Linear complexity of the Naor-Reingold pseudo-random function ⋮ On the \(k\)-error linear complexity over \({\mathbb F}_p\) of Legendre and Sidelnikov sequences ⋮ The expected value of the joint linear complexity of periodic multisequences ⋮ The independence of two randomness properties of sequences over finite fields ⋮ Joint string complexity for Markov sources: small data matters ⋮ On the linear complexity of Sidel'nikov sequences over nonprime fields ⋮ Enumeration results on linear complexity profiles and lattice profiles ⋮ On average sequence complexity ⋮ Joint linear complexity of multisequences consisting of linear recurring sequences ⋮ On the linear complexity profile of some new explicit inversive pseudorandom numbers ⋮ On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders ⋮ The expectation and variance of the joint linear complexity of random periodic multisequences ⋮ On the linear complexity profile of explicit nonlinear pseudorandom numbers. ⋮ Counting functions and expected values for the \(k\)-error linear complexity
This page was built for publication:
