Linear Complexity and Random Sequences
From MaRDI portal
Publication:3801067
DOI10.1007/3-540-39805-8_21zbMATH Open0654.68044OpenAlexW1484206430MaRDI QIDQ3801067FDOQ3801067
Authors: Rainer A. Rueppel 
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
Recommendations
- scientific article; zbMATH DE number 26870
- Centralizers and iterate radicals of morse-smale diffeomorphisms of the circle
- An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
- The study of some pseudorandom sequences used in cryptography
- Linear Complexity of Periodically Repeated Random Sequences
Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Cited In (66)
- A combinatorial approach to probabilistic results on the linear- complexity profile of random sequences
- Linear complexity and expansion complexity of some number theoretic sequences
- Cryptographic properties of some binary generalized cyclotomic sequences with the length \(p^{2}\)
- The Maximum Order Complexity of Sequence Ensembles
- The independence of two randomness properties of sequences over finite fields
- A wide family of nonlinear filter functions with a large linear span
- Linear complexity of binary generalized cyclotomic sequences over \(\mathrm{GF}(q)\)
- A family of keystream generators with large linear complexity
- On linear complexity of sequences over \(\text{GF}(2^n)\)
- Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR
- Security analysis of the public key algorithm based on Chebyshev polynomials over the integer ring \(Z_{N}\)
- On the linear complexity of Sidel'nikov sequences over nonprime fields
- Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
- Perfect linear complexity profile and apwenian sequences
- Jump and hop randomness tests for binary sequences
- Linear complexity profiles and jump complexity
- Aspects of Linear Complexity
- Linear complexity of the \(x^{2} \bmod p\) orbits
- On the general classification of nonlinear filters of \(m\)-sequences
- On the linear complexity of the sequences generated by nonlinear filterings
- The expected value of the joint linear complexity of periodic multisequences
- Efficient image or video encryption based on spatiotemporal chaos system
- On the constructions and nonlinearity of binary vector-output correlation-immune functions
- Linear complexity of generalized cyclotomic binary sequences of order 2
- 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)
- On linear dependencies in subspaces of LFSR-generated sequences
- On the balancedness of nonlinear generators of binary sequences.
- On the joint linear complexity profile of explicit inversive multisequences
- An efficient algorithm to generate binary sequences for cryptographic purposes
- Multisequences with almost perfect linear complexity profile and function fields over finite fields
- On linear complexity of binary lattices. II
- Perfect staircase profile of linear complexity for finite sequences
- Linear Complexity of Periodically Repeated Random Sequences
- Error linear complexity measures for multisequences
- The expectation and variance of the joint linear complexity of random periodic multisequences
- Sequence complexity as a test for cryptographic systems
- A note on a conjecture concerning symmetric resilient functions
- Studies on the distribution of the shortest linear recurring sequences
- Multi-sequences with \(d\)-perfect property
- Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point
- Run distribution in nonlinear binary generators.
- A linear complexity analysis of quadratic residues and primitive roots spacings
- On the linear complexity profile of some new explicit inversive pseudorandom numbers
- On the linear complexity profile of explicit nonlinear pseudorandom numbers.
- The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence
- Improving the high order nonlinearity lower bound for Boolean functions with given algebraic immunity
- A chaotic stream cipher and the usage in video protection
- Correlation measure, linear complexity and maximum order complexity for families of binary sequences
- New upper bounds on the linear complexity
- On the \(N\)th linear complexity of automatic sequences
- The Probabilistic Theory of Linear Complexity
- Linear recursion properties of uncorrelated binary sequences
- An efficient binary sequence generator with cryptographic applications
- On finite pseudorandom binary lattices
- Expansion complexity and linear complexity of sequences over finite fields
- On the counting function of the lattice profile of periodic sequences
- On the security of image encryption method
- Nondegenerate functions and permutations
- On the limit of maximal density of sequences with a perfect linear complexity profile
- Ziv-Lempel Complexity for Periodic Sequences and its Cryptographic Application
- Confirmatory tests used in cipher systems evaluations
- The Binary Expansion of 1 p
- A simple computational model for acceptance/rejection of binary sequence generators
- Enumeration results on linear complexity profiles and lattice profiles
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Linear Complexity and Random Sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801067)
