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

DOI10.1007/S001459900024zbMATH Open0874.94029OpenAlexW2163925910MaRDI QIDQ1363072FDOQ1363072

Authors: M. 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

Recommendations

• 2-Adic shift registers
• A Survey of Feedback with Carry Shift Registers
• Fibonacci and Galois representations of feedback-with-carry shift registers
• Some remarks on FCSRs and implications for stream ciphers
• scientific article; zbMATH DE number 1088916

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)

Cites Work

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

Cited In (72)

• Fibonacci and Galois representations of feedback-with-carry shift registers
• Extended BDD-Based Cryptanalysis of Keystream Generators
• An efficient state recovery attack on the X-FCSR family of stream ciphers
• The 2-adic complexity of Yu-Gong sequences with interleaved structure and optimal autocorrelation magnitude
• A lower bound on the 2-adic complexity of the modified Jacobi sequence
• A matrix approach for FCSR automata
• Title not available (Why is that?)
• 2-adic complexity of two classes of generalized cyclotomic binary sequences
• Statistical properties of half-\(\ell\)-sequences
• Periodic sequences with maximal \(N\)-adic complexity and large \(k\)-error \(N\)-adic complexity over \(Z/(N)\)
• A Survey of Feedback with Carry Shift Registers
• Fast construction of binary ring FCSRs for hardware stream ciphers
• Periodicity and correlation properties of \(d\)-FCSR sequences
• Statistical properties of the arithmetic correlation of sequences
• A lower bound on the linear span of an FCSR
• 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
• 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\)
• Expected values for the rational complexity of finite binary sequences
• Title not available (Why is that?)
• 2-adic complexity of binary sequences with interleaved structure
• Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences.
• Title not available (Why is that?)
• The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude
• Cryptanalysis of the knapsack generator
• Expected π-Adic Security Measures of Sequences
• Breaking the stream ciphers F-FCSR-H and F-FCSR-16 in real time
• On the \(k\)-error linear complexity of \(\ell\)-sequences
• A note on the crosscorrelation of maximal length FCSR sequences
• Construction of Transition Matrices for Ternary Ring Feedback With Carry Shift Registers
• Periodicity and Distribution Properties of Combined FCSR Sequences
• On the distinctness of modular reductions of primitive sequences modulo square-free odd integers
• 2-Adic and Linear Complexities of a Class of Whiteman’s Generalized Cyclotomic Sequences of Order Four
• 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
• Entropy of the Internal State of an FCSR in Galois Representation
• Some Results on the Arithmetic Correlation of Sequences
• X-FCSR – A New Software Oriented Stream Cipher Based Upon FCSRs
• Autocorrelations of \(l\)-sequences with prime connection integer
• On the linear complexity of FCSR sequences
• Symmetric 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period \(pq\)
• 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 \(\mathbb Z/(N)\)
• Lower bounds on error complexity measures for periodic LFSR and FCSR sequences
• Linearity properties of binary 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
• Some remarks on FCSRs and implications for stream ciphers
• Matrix parametrized shift registers
• Vectorial conception of FCSR
• Feedback With Carry Shift Registers Synthesis With the Euclidean Algorithm
• A new algorithm on the minimal rational fraction representation of feedback with carry shift registers
• On the distinctness of modular reductions of maximal length sequences modulo odd prime powers
• Distributional properties of \(d\)-FCSR sequences
• Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction
• AFSRs synthesis with the extended Euclidean rational approximation algorithm
• On lattice-based algebraic feedback shift registers synthesis for multisequences
• Optimal modes of operation of pseudorandom sequence generators based on DLFSRs
• On the symmetric 2-adic complexity of periodic binary sequences
• Symmetric 2-adic complexity of Tang-Gong interleaved sequences from generalized GMW sequence pair
• Symmetric 4-adic complexity of quaternary sequences with low autocorrelation and period \(p q\)
• Title not available (Why is that?)
• On the 2-adic complexity of cyclotomic binary sequences with period \(p^2\) and \(2p^2\)
• Open problems on with-carry sequence generators
• A SISO Register Circuit Tailored for Input Data with Low Transition Probability
• Parallel Generation of ℓ-Sequences
• On the 2-adic complexity of cyclotomic binary sequences of order three
• Title not available (Why is that?)
• Symmetric 4-adic complexity of quaternary generalized cyclotomic sequences of order four with period \(2p^n\)

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)