scientific article; zbMATH DE number 3422259

Publication date: 1967

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

cycle structure shift register sequences linear shift register nonlinear shift register sequences classification of Boolean functions factorization of trinomials over Galois Field linear recurring sequences modulo sequences with random properties structural properties of maximum length

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) 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) Boolean functions (94D10)

Related Items (only showing first 100 items - show all)

Cryptanalysis of the class of maximum period Galois NLFSR-based stream ciphers ⋮ The $v \times v $$(0,1,-1)$-Circulant Equation $AA^T = v I - J$ ⋮ Obtaining Specified Irreducible Polynomials over Finite Fields ⋮ Random Colorings of a Lattice of Squares in the Plane ⋮ A visual analysis method of randomness for classifying and ranking pseudo-random number generators ⋮ Secrets of Linear Feedback Shift Registers ⋮ On the nonlinearity of maximum-length NFSR feedbacks ⋮ A fast algorithm for testing reducibility of trinomials mod~2 and some new primitive trinomials of degree 3021377 ⋮ Isomorphism and equivalence of Galois nonlinear feedback shift registers ⋮ Analysis of pseudo-noise sequences generated by null boundary cellular automata ⋮ Linear complexity of second order PN_sequences addition with single order PN_sequence in nonlinear filter generator ⋮ Linearization of multi-valued nonlinear feedback shift registers ⋮ Linear analysis of switching nets ⋮ Unnamed Item ⋮ Stretching de Bruijn sequences ⋮ A new upper bound on the order of affine sub-families of NFSRs ⋮ A new random number generator from permutation groups ⋮ A Simple Construction of Almost Perfect Quinary ASK and QAM Sequences ⋮ On a class of isomorphic NFSRs ⋮ The linear complexity of generalized cyclotomic binary sequences of period $p^n$ ⋮ Designing preference functions for de Bruijn sequences with forbidden words ⋮ Generalized trigonometry and Chebyshev functions in finite fields ⋮ A novel method for driven stability of NFSRs via STP ⋮ Random feedback shift registers and the limit distribution for largest cycle lengths ⋮ A general construction of regular complete permutation polynomials ⋮ On the 2-adic complexity of cyclotomic binary sequences of order three ⋮ Maximal complete permutations over $\mathbb{F}_2^n $ ⋮ Graphs with the unique path property: Structure, cycles, factors, and constructions ⋮ Status of three classes of sequences ⋮ A novel perturbation method to reduce the dynamical degradation of digital chaotic maps ⋮ Linear complexity of generalized cyclotomic sequences with period $p^nq^m$ ⋮ On the 2-adic complexity of cyclotomic binary sequences with period $p^2$ and $2p^2$ ⋮ New characterizations for the multi-output correlation-immune Boolean functions ⋮ The Fourier spectral characterization for the correlation-immune functions over $\mathbb{F}_p $ ⋮ The cycle structure of a class of permutation polynomials ⋮ On the largest affine sub-families of a family of NFSR sequences ⋮ Unnamed Item ⋮ Employing AVX vectorization to improve the performance of random number generators ⋮ Nonsingular Polynomials from Feedback Shift Registers ⋮ On the Representation of Gliders in Rule 54 by De Bruijn and Cycle Diagrams ⋮ Cryptography and cryptographic protocols ⋮ The Fast Fourier Transform in a Finite Field ⋮ Irreducible trinomials over finite fields ⋮ On the Use of Reducible Polynomials as Random Number Generators ⋮ A note on the cross-correlation function between two binary maximal length linear sequences ⋮ A new linearization method for nonlinear feedback shift registers ⋮ Unnamed Item ⋮ Swan's theorem for binary tetranomials ⋮ On the Periods of Generalized Fibonacci Recurrences ⋮ Four Families of Binary Sequences with Low Correlation and Large Linear Complexity ⋮ Improved Bounds on the Linear Complexity of Keystreams Obtained by Filter Generators ⋮ Comparison of Point Sets and Sequences for Quasi-Monte Carlo and for Random Number Generation ⋮ Projective de Bruijn Sequences ⋮ Sequences, DFT and Resistance against Fast Algebraic Attacks ⋮ A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space ⋮ Remarks on the New Attack on the Filter Generator and the Role of High Order Complexity ⋮ Randomness and Representation of Span n Sequences ⋮ Further results on the equivalence between Galois NFSRs and Fibonacci NFSRs ⋮ The Evolution of Spread-Spectrum Multiple-Access Communications ⋮ Optimum PN Sequences for CDMA Systems ⋮ A proof of Golomb's conjecture for the de Bruijn graph ⋮ Statistical mechanics of cellular automata ⋮ Theory of transformation groups of polynomials over $\mathrm{GF}(2)$ with applications to linear shift register sequences ⋮ A note on nonuniform decimation of periodic sequences ⋮ On extremal factors of the de Bruijn graph ⋮ Factorization of composed polynomials and applications ⋮ Linear complexity of generalized cyclotomic sequences of period $2p^m$ ⋮ De Bruijn digraphs and affine transformations ⋮ Euler’s constant: Euler’s work and modern developments ⋮ On affine sub-families of the NFSR in grain ⋮ Analytical Characteristics of the DES ⋮ Further factorization of xn − 1 over a finite field (II) ⋮ Primitive Binary Polynomials ⋮ Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences ⋮ Random difference equations: An asymptotical result ⋮ Invertible shift-invariant transformations on binary arrays ⋮ Random sequence generation by cellular automata ⋮ An algorithm for generating necklaces of beads in two colors ⋮ On the linear complexity of the sequences generated by nonlinear filterings ⋮ Equidistant frequency permutation arrays and related constant composition codes ⋮ Efficient hardware implementation of finite fields with applications to cryptography ⋮ On the cycles and adjacencies in the complementary circulating register ⋮ New classes of perfect maps. I ⋮ The adjacency graphs of FSRs with a class of affine characteristic functions ⋮ A conjecture on the existence of cyclic Hadamard difference sets ⋮ On the structure of parallelized random number sources ⋮ New cyclic difference sets with Singer parameters ⋮ The origins of combinatorics on words ⋮ Characterising the linear complexity of span 1 de Bruijn sequences over finite fields. ⋮ On the number of permutations on $n$ objects with greatest cycle length $k$ ⋮ Periods of some nonlinear shift registers ⋮ Enumerating cycles in the graph of overlapping permutations ⋮ Decompositions of linear sequential circuits over residue class rings ⋮ Nonsingularity of feedback shift registers ⋮ Combinatorics of Boolean automata circuits dynamics ⋮ The simulation of random processes on digital computers with Chebyshev mixing transformations ⋮ Generation of some de Bruijn sequences ⋮ RNGSSELIB: program library for random number generation, SSE2 realization ⋮ Primitive polynomials, Singer cycles and word-oriented linear feedback shift registers ⋮ Spans of preference functions for de Bruijn sequences

This page was built for publication: