Feedback shift registers, 2-adic span, and combiners with memory

DOI10.1007/s001459900024zbMath0874.94029OpenAlexW2163925910MaRDI QIDQ1363072

Mark Goresky, Andrew Klapper

Publication date: 7 August 1997

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001459900024

zbMATH Keywords

cryptanalysisbinary sequence2-adic numbersarithmetic codesfeedback shift registerscombiner with memory

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items

2-adic complexity of two constructions of binary sequences with period \(4N\) and optimal autocorrelation magnitude ⋮ Statistical properties of half-\(\ell\)-sequences ⋮ The symmetric 2-adic complexity of sequences with optimal autocorrelation magnitude and length \(8q\) ⋮ Rational complexity of binary sequences, F\(\mathbb{Q}\)SRs, and pseudo-ultrametric continued fractions in \(\mathbb{R}\) ⋮ The 2-adic complexity of Yu-Gong sequences with interleaved structure and optimal autocorrelation magnitude ⋮ STATISTICAL PROPERTIES OF THE ARITHMETIC CORRELATION OF SEQUENCES ⋮ On the joint 2-adic complexity of binary multisequences ⋮ Expected values for the rational complexity of finite binary sequences ⋮ Linear complexity over \(\mathbb{F}_q\) and 2-adic complexity of a class of binary generalized cyclotomic sequences with good autocorrelation ⋮ On the \(k\)-error linear complexity of \(\ell\)-sequences ⋮ Symmetric 4-adic complexity of quaternary generalized cyclotomic sequences of order four with period \(2p^n\) ⋮ On the 2-adic complexity of cyclotomic binary sequences of order three ⋮ Periodic sequences with maximal \(N\)-adic complexity and large \(k\)-error \(N\)-adic complexity over \(Z/(N)\) ⋮ Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences. ⋮ Matrix parametrized shift registers ⋮ On the 2-adic complexity of cyclotomic binary sequences with period \(p^2\) and \(2p^2\) ⋮ On lattice-based algebraic feedback shift registers synthesis for multisequences ⋮ The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation ⋮ The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude ⋮ 2-Adic Complexity of Two Classes of Generalized Cyclotomic Binary Sequences ⋮ Entropy of the Internal State of an FCSR in Galois Representation ⋮ Breaking the stream ciphers F-FCSR-H and F-FCSR-16 in real time ⋮ An efficient state recovery attack on the X-FCSR family of stream ciphers ⋮ On the distinctness of modular reductions of primitive sequences modulo square-free odd integers ⋮ On the linear complexity of FCSR sequences ⋮ A matrix approach for FCSR automata ⋮ A lower bound on the 2-adic complexity of the modified Jacobi sequence ⋮ 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 \(\mathbb Z/(N)\) ⋮ Fast construction of binary ring FCSRs for hardware stream ciphers ⋮ Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction ⋮ Fast Correlation Attacks: Methods and Countermeasures ⋮ Cryptanalysis of the Knapsack Generator ⋮ AFSRs synthesis with the extended Euclidean rational approximation algorithm ⋮ On the distinctness of modular reductions of maximal length sequences modulo odd prime powers ⋮ 2-adic complexity of binary sequences with interleaved structure ⋮ Some Results on the Arithmetic Correlation of Sequences ⋮ Expected π-Adic Security Measures of Sequences ⋮ Parallel Generation of ℓ-Sequences ⋮ Extended BDD-Based Cryptanalysis of Keystream Generators ⋮ 2-Adic and Linear Complexities of a Class of Whiteman’s Generalized Cyclotomic Sequences of Order Four ⋮ Linearity properties of binary FCSR sequences ⋮ Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of periods of twin prime products ⋮ 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 note on the crosscorrelation of maximal length FCSR sequences ⋮ Periods of termwise exclusive ors of maximal length FCSR sequences ⋮ A new algorithm on the minimal rational fraction representation of feedback with carry shift registers ⋮ Symmetric 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period \(pq\) ⋮ Some remarks on FCSRs and implications for stream ciphers ⋮ Lower bounds on error complexity measures for periodic LFSR and FCSR sequences ⋮ Autocorrelations of \(l\)-sequences with prime connection integer ⋮ Distributional properties of \(d\)-FCSR sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new class of random number generators
• Mapping integers and Hensel codes onto Farey fractions
• Approximation lattices of \(p\)-adic numbers
• Analysis and design of stream ciphers
• Correlation properties of combiners with memory in stream ciphers
• Fast multiplication of large numbers
• An approach to an arithmetic analog of Berlekamp's algorithm (Corresp.)
• On the continued fraction and Berlekamp's algorithm (Corresp.)
• On the quadratic spans of DeBruijn sequences
• A Simple Unpredictable Pseudo-Random Number Generator
• Continued fractions and the Berlekamp-Massey algorithm
• Continued Fractions and Linear Recurrences
• A class of balanced binary sequences with optimal autocorrelation properties
• Continued fractions and Berlekamp's algorithm
• 2-Adic shift registers
• Arithmetic codes with large distance
• On Artin's conjecture.
• The Fast Fourier Transform in a Finite Field