Shift Register Sequences

@inproceedings{Golomb1981ShiftRS,
  title={Shift Register Sequences},
  author={Solomon W. Golomb},
  year={1981}
}
From the Publisher: Shift register sequences are used in a broad range of applications, particularly in random number generation, multiple access and polling techniques, secure and privacy communication systems, error detecting and correcting codes, and synchronization pattern generation, as well as in modern cryptographic systems. The first edition of Shift Register Sequences, published in 1967, has been for many years the definitive work on this subject. In the revised edition, Dr. Golomb… Expand
Shift Register Sequences - A Retrospective Account
  • S. Golomb
  • Mathematics, Computer Science
  • SETA
  • 2006
TLDR
The class of m-sequences is too small, and has too many regularities, to provide useful cryptographic security as key sequences for stream ciphers, for this purpose, nonlinear shift register sequences which have large linear span and a sufficiently high degree of correlation immunity may be employed. Expand
Matrix parametrized shift registers
  • A. Klapper
  • Mathematics, Computer Science
  • Cryptography and Communications
  • 2017
TLDR
An algebraic structure is described, the T-adic numbers, and it is used to study the periodicity of T-generators, a new generalization of FCSRs in which the uniformizing parameter N∈ℤ$N\in \mathbb {Z}$ is replaced by a square matrix, T, resulting in what is called T-Generators. Expand
Topics on Register Synthesis Problems
TLDR
A modification of the Berlekamp-Massey algorithm, Xu’s algorithm solves the synthesis problem for AFSRs over a pair (R, π) with certain algebraic properties and two register synthesis algorithms are proposed. Expand
Five decade evolution of feedback shift register: algorithms, architectures and applications
TLDR
A brief overview of the key expansion in the feedback shift register and feedback with carry shift register of either linear or nonlinear with the sequential and/or parallel processing architectures along with their concealed and imminent applications is addressed. Expand
Feedback Shift Register Sequences
Feedback Shift Register (FSR) sequences have been successfully implemented in many communication systems for their randomness properties and ease of implementation. These include ranging andExpand
On binary sequences generated by self-clock controlled LFSR
The paper considers some peculiar proper- ties of binary sequences generated by self-clocked linear feedback shift registers of maximum length, and compares these properties with those of trulyExpand
Parallel Generation of-Sequences
The generation of pseudo-random sequences at a high rate is an important issue in modern communication schemes. The representation of a sequence can be scaled by decimation to obtain parallelism andExpand
Generation of pseudorandom binary sequences by means of linear feedback shift registers (LFSRs) with dynamic feedback
TLDR
The particular topology of a pseudorandom bit generator based on a dynamic linear feedback shift register (DLFSR) proposed is analyzed, allowing the results to be extended to more general cases and to apply the general interleaved sequence model proposed by Gong. Expand
On sequence lengths of some special external exclusive OR type LFSR structures - Study and analysis
The study of the length of pseudo-random binary sequences generated by Linear- Feedback Shift Registers (LFSRs) plays an important role in the design approaches of built-in selftest, cryptosystems,Expand
On the Construction of Run Permuted Sequences
This paper describes the construction of classes of binary sequences, which are obtained by permuting the runs of zeroes and ones of some given periodic binary sequence s = (s0, s1,...,sp-1)?, si ?Expand
...
1
2
3
4
5
...