Shift Register Sequences – A Retrospective Account
From MaRDI portal
Publication:3541902
DOI10.1007/11863854_1zbMath1152.94383OpenAlexW1515461195MaRDI QIDQ3541902
Publication date: 27 November 2008
Published in: Sequences and Their Applications – SETA 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11863854_1
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02)
Related Items (48)
Analysis of periodic linear systems over finite fields with and without Floquet transform ⋮ Further results on the nonlinearity of maximum-length NFSR feedbacks ⋮ Statistical properties of half-\(\ell\)-sequences ⋮ Grain-like structures with minimal and maximal period sequences ⋮ A novel method for reconstructing period with single input in NFSR ⋮ Generating a PRSA with triangular symmetry ⋮ On ideal \(t\)-tuple distribution of orthogonal functions in filtering de Bruijn generators ⋮ Computing the linear complexity for sequences with characteristic polynomial \(f^v\) ⋮ Correlation immune functions with respect to the \(q\)-transform ⋮ The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields ⋮ Construction for de Bruijn sequences with large stage ⋮ Exact formula for exponents of mixing digraphs for register transformations ⋮ The cycle structure of \(\mathrm{NFSR}(f^d)\) and its applications ⋮ Algorithm 938 ⋮ On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials ⋮ Generation of full cycles by a composition of NLFSRs ⋮ Divisibility of polynomials over finite fields and combinatorial applications ⋮ Construction of de Bruijn sequences from product of two irreducible polynomials ⋮ Matrix parametrized shift registers ⋮ Message authentication based on cryptographically secure CRC without polynomial irreducibility test ⋮ A novel stream encryption scheme with avalanche effect ⋮ On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs ⋮ A construction of primitive polynomials over finite fields ⋮ On ideal \(t\)-tuple distribution of filtering de Bruijn sequence generators ⋮ Some conditions for absence of affine functions in NFSR output stream ⋮ Espresso: a stream cipher for 5G wireless communication systems ⋮ Division of tetranomials by type II pentanomials and orthogonal arrays ⋮ Construction of primitive polynomials over finite fields ⋮ Translation invariant extensions of finite volume measures ⋮ An efficient algorithm for software generation of binary linear recurrences ⋮ Chaotic Cellular Automata with Cryptographic Application ⋮ How to Strengthen Pseudo-random Generators by Using Compression ⋮ Parallel Generation of ℓ-Sequences ⋮ Koopman operator approach for computing structure of solutions and observability of nonlinear dynamical systems over finite fields ⋮ A Sample of Samplers: A Computational Perspective on Sampling ⋮ On the \(k\)-error linear complexities of De Bruijn sequences ⋮ Applying a generalized allocation scheme to analyzing a class of sequences generated by a shift register ⋮ A one-key cryptosystem based on a finite nonlinear automaton ⋮ On the Stability of m-Sequences ⋮ Stochastic rounding and reduced-precision fixed-point arithmetic for solving neural ordinary differential equations ⋮ On the uniqueness of a type of cascade connection representations for NFSRs ⋮ Binomial representation of cryptographic binary sequences and its relation to cellular automata ⋮ R-2 composition tests: a family of statistical randomness tests for a collection of binary sequences ⋮ A number theoretic view on binary shift registers ⋮ Cross-correlations of geometric sequences in characteristic two ⋮ Analysis of a PRSA generator ⋮ A generic method for investigating nonsingular Galois NFSRs ⋮ Chinese remainder encoding for Hamiltonian cycles
This page was built for publication: Shift Register Sequences – A Retrospective Account
