Pages that link to "Item:Q1363072"

The following pages link to Feedback shift registers, 2-adic span, and combiners with memory (Q1363072):

Displaying 50 items.

• Statistical properties of half-\(\ell\)-sequences (Q276560) (← links)
• Periodic sequences with maximal \(N\)-adic complexity and large \(k\)-error \(N\)-adic complexity over \(Z/(N)\) (Q413471) (← links)
• Breaking the stream ciphers F-FCSR-H and F-FCSR-16 in real time (Q451122) (← links)
• On the distinctness of modular reductions of primitive sequences modulo square-free odd integers (Q456158) (← links)
• A generalized birthday approach for efficiently finding linear relations in \(\ell\)-sequences (Q488250) (← links)
• FCSR periodic multisequences with maximal joint \(N\)-adic complexity and large \(k\)-error joint \(N\)-adic complexity over \(\mathbb Z/(N)\) (Q488927) (← links)
• AFSRs synthesis with the extended Euclidean rational approximation algorithm (Q514533) (← links)
• On the \(k\)-error linear complexity of \(\ell\)-sequences (Q609360) (← links)
• A matrix approach for FCSR automata (Q662175) (← links)
• Periodicity and correlation properties of \(d\)-FCSR sequences (Q702173) (← links)
• Linearity properties of binary FCSR sequences (Q735027) (← links)
• The 2-adic complexity of Yu-Gong sequences with interleaved structure and optimal autocorrelation magnitude (Q831160) (← links)
• A note on the crosscorrelation of maximal length FCSR sequences (Q1009127) (← links)
• Periods of termwise exclusive ors of maximal length FCSR sequences (Q1011452) (← links)
• Lower bounds on error complexity measures for periodic LFSR and FCSR sequences (Q1032491) (← links)
• Autocorrelations of \(l\)-sequences with prime connection integer (Q1032498) (← links)
• Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences. (Q1401213) (← links)
• On the linear complexity of FCSR sequences (Q1430963) (← links)
• Matrix parametrized shift registers (Q1696142) (← links)
• On lattice-based algebraic feedback shift registers synthesis for multisequences (Q1699261) (← links)
• The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation (Q1699262) (← links)
• A lower bound on the 2-adic complexity of the modified Jacobi sequence (Q1733986) (← links)
• Fast construction of binary ring FCSRs for hardware stream ciphers (Q1741931) (← links)
• Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction (Q1744015) (← links)
• Distributional properties of \(d\)-FCSR sequences (Q1827571) (← links)
• 2-adic complexity of binary sequences with interleaved structure (Q2011478) (← links)
• Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of periods of twin prime products (Q2040329) (← links)
• Symmetric 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period \(pq\) (Q2057157) (← links)
• 2-adic complexity of two constructions of binary sequences with period \(4N\) and optimal autocorrelation magnitude (Q2121016) (← links)
• The symmetric 2-adic complexity of sequences with optimal autocorrelation magnitude and length \(8q\) (Q2130036) (← links)
• Rational complexity of binary sequences, F\(\mathbb{Q}\)SRs, and pseudo-ultrametric continued fractions in \(\mathbb{R}\) (Q2130054) (← links)
• Linear complexity over \(\mathbb{F}_q\) and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation (Q2161414) (← links)
• The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude (Q2202907) (← links)
• A new algorithm on the minimal rational fraction representation of feedback with carry shift registers (Q2302154) (← links)
• Expected values for the rational complexity of finite binary sequences (Q2380400) (← links)
• An efficient state recovery attack on the X-FCSR family of stream ciphers (Q2442642) (← links)
• On the distinctness of maximal length sequences over \(\mathbb Z/(pq)\) modulo 2 (Q2517812) (← links)
• On the joint 2-adic complexity of binary multisequences (Q2905327) (← links)
• 2-Adic Complexity of Two Classes of Generalized Cyclotomic Binary Sequences (Q2970210) (← links)
• Fast Correlation Attacks: Methods and Countermeasures (Q3013077) (← links)
• Cryptanalysis of the Knapsack Generator (Q3013084) (← links)
• STATISTICAL PROPERTIES OF THE ARITHMETIC CORRELATION OF SEQUENCES (Q3173472) (← links)
• Some remarks on FCSRs and implications for stream ciphers (Q3400067) (← links)
• Entropy of the Internal State of an FCSR in Galois Representation (Q3525685) (← links)
• On the distinctness of modular reductions of maximal length sequences modulo odd prime powers (Q3577015) (← links)
• Some Results on the Arithmetic Correlation of Sequences (Q3600427) (← links)
• Expected π-Adic Security Measures of Sequences (Q3600443) (← links)
• Parallel Generation of ℓ-Sequences (Q3600451) (← links)
• 2-Adic and Linear Complexities of a Class of Whiteman’s Generalized Cyclotomic Sequences of Order Four (Q5205028) (← links)
• Extended BDD-Based Cryptanalysis of Keystream Generators (Q5452244) (← links)