Linear Complexity and Random Sequences
From MaRDI portal
Publication:3801067
DOI10.1007/3-540-39805-8_21zbMath0654.68044OpenAlexW1484206430MaRDI QIDQ3801067
Publication date: 1986
Published in: Advances in Cryptology — EUROCRYPT’ 85 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-39805-8_21
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Related Items (49)
On linear complexity of sequences over \(\text{GF}(2^n)\) ⋮ Jump and hop randomness tests for binary sequences ⋮ Linear complexity profiles and jump complexity ⋮ On the general classification of nonlinear filters of \(m\)-sequences ⋮ Linear complexity of the \(x^{2} \bmod p\) orbits ⋮ On the linear complexity of the sequences generated by nonlinear filterings ⋮ Studies on the distribution of the shortest linear recurring sequences ⋮ Efficient image or video encryption based on spatiotemporal chaos system ⋮ Improving the high order nonlinearity lower bound for Boolean functions with given algebraic immunity ⋮ Error linear complexity measures for multisequences ⋮ The expected value of the joint linear complexity of periodic multisequences ⋮ The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence ⋮ The independence of two randomness properties of sequences over finite fields ⋮ A LINEAR COMPLEXITY ANALYSIS OF QUADRATIC RESIDUES AND PRIMITIVE ROOTS SPACINGS ⋮ Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring \(Z_{N}\) ⋮ A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences ⋮ A note on a conjecture concerning symmetric resilient functions ⋮ Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\) ⋮ On the security of image encryption method ⋮ On the counting function of the lattice profile of periodic sequences ⋮ Nondegenerate functions and permutations ⋮ A chaotic stream cipher and the usage in video protection ⋮ A simple computational model for acceptance/rejection of binary sequence generators ⋮ On finite pseudorandom binary lattices ⋮ Perfect linear complexity profile and apwenian sequences ⋮ On the linear complexity of Sidel'nikov sequences over nonprime fields ⋮ Cryptographic properties of some binary generalized cyclotomic sequences with the length \(p^{2}\) ⋮ Perfect staircase profile of linear complexity for finite sequences ⋮ Multisequences with almost perfect linear complexity profile and function fields over finite fields ⋮ Comments on L. J. García-Villalba and M. C. Rodríguez-Palánquex, A family of keystream generators with large linear complexity, Appl. Math. Lett. 14, No.5, 545-547 (2001; Zbl 0995.94031) ⋮ Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR ⋮ Run distribution in nonlinear binary generators. ⋮ Enumeration results on linear complexity profiles and lattice profiles ⋮ A family of keystream generators with large linear complexity ⋮ An efficient algorithm to generate binary sequences for cryptographic purposes ⋮ A wide family of nonlinear filter functions with a large linear span ⋮ On the joint linear complexity profile of explicit inversive multisequences ⋮ Multi-sequences with \(d\)-perfect property ⋮ Linear complexity of generalized cyclotomic binary sequences of order 2 ⋮ Correlation measure, linear complexity and maximum order complexity for families of binary sequences ⋮ New upper bounds on the linear complexity ⋮ On the constructions and nonlinearity of binary vector-output correlation-immune functions ⋮ On the linear complexity profile of some new explicit inversive pseudorandom numbers ⋮ An efficient binary sequence generator with cryptographic applications ⋮ The expectation and variance of the joint linear complexity of random periodic multisequences ⋮ On the linear complexity profile of explicit nonlinear pseudorandom numbers. ⋮ On the balancedness of nonlinear generators of binary sequences. ⋮ Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform ⋮ Linear recursion properties of uncorrelated binary sequences
This page was built for publication: Linear Complexity and Random Sequences
