2-Adic shift registers
From MaRDI portal
Publication:4499408
DOI10.1007/3-540-58108-1_21zbMath0943.94515MaRDI QIDQ4499408
Publication date: 30 August 2000
Published in: Fast Software Encryption (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-58108-1_21
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
94A60: Cryptography
Related Items
2-Adic and Linear Complexities of a Class of Whiteman’s Generalized Cyclotomic Sequences of Order Four, Spectral density estimation for symmetric stable p-adic processes, X-FCSR – A New Software Oriented Stream Cipher Based Upon FCSRs, Statistical properties of half-\(\ell\)-sequences, Stream cipher encryption of random access files, Finite automata and numbers, Periodic sequences with maximal \(N\)-adic complexity and large \(k\)-error \(N\)-adic complexity over \(Z/(N)\), Breaking the stream ciphers F-FCSR-H and F-FCSR-16 in real time, On the distinctness of modular reductions of primitive sequences modulo square-free odd integers, 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)\), Practical construction of ring LFSRs and ring FCSRs with low diffusion delay for hardware cryptographic applications, A new result on the distinctness of primitive sequences over \(\mathbb Z/(pq)\) modulo 2, On the \(k\)-error linear complexity of \(\ell\)-sequences, A matrix approach for FCSR automata, Linearity properties of binary FCSR sequences, A note on the crosscorrelation of maximal length FCSR sequences, Periods of termwise exclusive ors of maximal length FCSR sequences, Autocorrelations of \(l\)-sequences with prime connection integer, Feedback shift registers, 2-adic span, and combiners with memory, Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences., On the linear complexity of FCSR sequences, On lattice-based algebraic feedback shift registers synthesis for multisequences, Fast construction of binary ring FCSRs for hardware stream ciphers, 2-adic complexity of binary sequences with interleaved structure, 2-adic complexity of two constructions of binary sequences with period \(4N\) and optimal autocorrelation magnitude, On the linear complexity of feedforward clock-controlled sequence, A new algorithm on the minimal rational fraction representation of feedback with carry shift registers, Expected values for the rational complexity of finite binary sequences, An efficient state recovery attack on the X-FCSR family of stream ciphers, On the distinctness of maximal length sequences over \(\mathbb Z/(pq)\) modulo 2, Entropy of the Internal State of an FCSR in Galois Representation, Breaking the F-FCSR-H Stream Cipher in Real Time, Parallel Generation of ℓ-Sequences
