Feedback shift registers, 2-adic span, and combiners with memory
From MaRDI portal
(Redirected from Publication:1363072)
Recommendations
Cites work
- scientific article; zbMATH DE number 1676648 (Why is no real title available?)
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 4191554 (Why is no real title available?)
- scientific article; zbMATH DE number 3874496 (Why is no real title available?)
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 47698 (Why is no real title available?)
- scientific article; zbMATH DE number 47996 (Why is no real title available?)
- scientific article; zbMATH DE number 177035 (Why is no real title available?)
- scientific article; zbMATH DE number 3471923 (Why is no real title available?)
- scientific article; zbMATH DE number 1196713 (Why is no real title available?)
- scientific article; zbMATH DE number 1030997 (Why is no real title available?)
- scientific article; zbMATH DE number 1088916 (Why is no real title available?)
- scientific article; zbMATH DE number 1455089 (Why is no real title available?)
- scientific article; zbMATH DE number 218557 (Why is no real title available?)
- scientific article; zbMATH DE number 854547 (Why is no real title available?)
- scientific article; zbMATH DE number 3397423 (Why is no real title available?)
- 2-Adic shift registers
- A Simple Unpredictable Pseudo-Random Number Generator
- A class of balanced binary sequences with optimal autocorrelation properties
- A new class of random number generators
- An approach to an arithmetic analog of Berlekamp's algorithm (Corresp.)
- Analysis and design of stream ciphers
- Approximation lattices of \(p\)-adic numbers
- Arithmetic codes with large distance
- Continued Fractions and Linear Recurrences
- Continued fractions and Berlekamp's algorithm
- Continued fractions and the Berlekamp-Massey algorithm
- Correlation properties of combiners with memory in stream ciphers
- Fast multiplication of large numbers
- Mapping integers and Hensel codes onto Farey fractions
- On Artin's conjecture.
- On the continued fraction and Berlekamp's algorithm (Corresp.)
- On the quadratic spans of DeBruijn sequences
- The Fast Fourier Transform in a Finite Field
Cited in
(81)- Symmetric 4-adic complexity of quaternary generalized cyclotomic sequences of order four with period 2p^n
- Fibonacci and Galois representations of feedback-with-carry shift registers
- Probabilistic results on the 2-adic complexity
- The 2-adic complexity of Yu-Gong sequences with interleaved structure and optimal autocorrelation magnitude
- An efficient state recovery attack on the X-FCSR family of stream ciphers
- Extended BDD-Based Cryptanalysis of Keystream Generators
- A matrix approach for FCSR automata
- A lower bound on the 2-adic complexity of the modified Jacobi sequence
- Optimal modes of operation of pseudorandom sequence generators based on DLFSRs
- scientific article; zbMATH DE number 1676648 (Why is no real title available?)
- Statistical properties of half--sequences
- 2-adic complexity of two classes of generalized cyclotomic binary sequences
- Periodic sequences with maximal N-adic complexity and large k-error N-adic complexity over Z/(N)
- Periodicity and correlation properties of \(d\)-FCSR sequences
- Fast construction of binary ring FCSRs for hardware stream ciphers
- A Survey of Feedback with Carry Shift Registers
- Statistical properties of the arithmetic correlation of sequences
- On the joint 2-adic complexity of binary multisequences
- 2-adic complexity of two constructions of binary sequences with period \(4N\) and optimal autocorrelation magnitude
- On the symmetric 2-adic complexity of periodic binary sequences
- A lower bound on the linear span of an FCSR
- Binary sequences with ideal and small arithmetic correlations
- The 4-adic complexity of new quaternary sequences with good autocorrelation
- The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation
- Rational complexity of binary sequences, F\(\mathbb{Q}\)SRs, and pseudo-ultrametric continued fractions in \(\mathbb{R}\)
- The symmetric 2-adic complexity of sequences with optimal autocorrelation magnitude and length 8q
- Symmetric 2-adic complexity of Tang-Gong interleaved sequences from generalized GMW sequence pair
- The 4-adic complexity of quaternary sequences with low autocorrelation and high linear complexity
- Expected values for the rational complexity of finite binary sequences
- scientific article; zbMATH DE number 1088916 (Why is no real title available?)
- 2-adic complexity of binary sequences with interleaved structure
- Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences.
- The symmetric 2-adic complexity of Tang-Gong interleaved sequences from Legendre sequence pair
- scientific article; zbMATH DE number 1955779 (Why is no real title available?)
- The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude
- On the 2-adic complexity of cyclotomic binary sequences of order four
- Symmetric 4-adic complexity of quaternary sequences with low autocorrelation and period p q
- Breaking the stream ciphers F-FCSR-H and F-FCSR-16 in real time
- Cryptanalysis of the knapsack generator
- Expected π-Adic Security Measures of Sequences
- On the k-error linear complexity of -sequences
- A note on the crosscorrelation of maximal length FCSR sequences
- Construction of Transition Matrices for Ternary Ring Feedback With Carry Shift Registers
- On the distinctness of modular reductions of primitive sequences modulo square-free odd integers
- Periodicity and Distribution Properties of Combined FCSR Sequences
- scientific article; zbMATH DE number 4137710 (Why is no real title available?)
- Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of periods of twin prime products
- Periods of termwise exclusive ors of maximal length FCSR sequences
- 2-Adic and Linear Complexities of a Class of Whiteman’s Generalized Cyclotomic Sequences of Order Four
- On the 2-adic complexity of cyclotomic binary sequences with period \(p^2\) and \(2p^2\)
- Pattern sets for \(\mathbb{F}_q\)-sequences invariant under the continued fraction operator K (the Berlekamp-Massey algorithm)
- Entropy of the Internal State of an FCSR in Galois Representation
- Some Results on the Arithmetic Correlation of Sequences
- Autocorrelations of l-sequences with prime connection integer
- On the linear complexity of FCSR sequences
- Open problems on with-carry sequence generators
- Symmetric 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period \(pq\)
- X-FCSR – A New Software Oriented Stream Cipher Based Upon FCSRs
- On the distinctness of maximal length sequences over \(\mathbb Z/(pq)\) modulo 2
- A generalized birthday approach for efficiently finding linear relations in \(\ell\)-sequences
- FCSR periodic multisequences with maximal joint N-adic complexity and large k-error joint N-adic complexity over Z/(N)
- A SISO Register Circuit Tailored for Input Data with Low Transition Probability
- Linearity properties of binary FCSR sequences
- Lower bounds on error complexity measures for periodic LFSR and FCSR sequences
- Fast Correlation Attacks: Methods and Countermeasures
- Linear complexity over \(\mathbb{F}_q\) and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation
- Matrix parametrized shift registers
- Parallel Generation of ℓ-Sequences
- Some remarks on FCSRs and implications for stream ciphers
- Vectorial conception of FCSR
- A new algorithm on the minimal rational fraction representation of feedback with carry shift registers
- Feedback With Carry Shift Registers Synthesis With the Euclidean Algorithm
- On the distinctness of modular reductions of maximal length sequences modulo odd prime powers
- Distributional properties of \(d\)-FCSR sequences
- On the ideal arithmetic autocorrelation of binary FCSR sequences
- Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction
- Linear complexity and 2-adic complexity of new cyclotomic binary sequences of order four with low autocorrelation
- On the 2-adic complexity of cyclotomic binary sequences of order three
- AFSRs synthesis with the extended Euclidean rational approximation algorithm
- scientific article; zbMATH DE number 1805963 (Why is no real title available?)
- On lattice-based algebraic feedback shift registers synthesis for multisequences
This page was built for publication: Feedback shift registers, 2-adic span, and combiners with memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363072)