Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 47 for “"Feedback shift registers"”.

  1. Sequences From Nonlinear Feedback Shift Registers.

    1.1 General Aspects of Shift-Register Generated Sequences An n-stage register is a device consisting of n consecutive two-state memory units controlled by a clock. At each clock pulse, the state ak (logical 1 or 0) of each memory stage, ak, is shifted to the adjacent stage of higher degree. A shift …

    unm Repository record for Sequences From Nonlinear Feedback Shift Registers. (opens in a new tab)

  2. Constructing de Bruijn sequences by concatenating cycles of feedback shift registers

    … that are based on concatenating cycles of feedback shift registers. Finally, we show that a brute force algorithm can generate the class of de Bruijn sequences in $O(k^2n^2)$-amortized time per universal cycle.

    guelph Repository record for Constructing de Bruijn sequences by concatenating cycles of feedback shift registers (opens in a new tab)

  3. Analysis of maximum length linear two-dimensional cellular automata

    … cellular automata and linear feed­back shift registers. This is accomplished by generating maximum length linear two-dimensional cellular automata, and performing the statistical pseudorandom tests on the sequences generated from these two-dimensional cellular automata. The use of …

    uvic Repository record for Analysis of maximum length linear two-dimensional cellular automata (opens in a new tab)

  4. A ULTRA-FAST QUANTUM RANDOM NUMBER GENERATOR

    … of the randomness extractors are based on Linear Feedback Shift Registers (LFSR). This leads to a significant simplification in the implementation of randomness extractors.

    nus Repository record for A ULTRA-FAST QUANTUM RANDOM NUMBER GENERATOR (opens in a new tab) Download file for A ULTRA-FAST QUANTUM RANDOM NUMBER GENERATOR (opens in a new tab)

  5. On the distribution of complexity for de Bruijn sequences

    … in communication systems for many years. Shift registers have been used in their generation, because of the ease and economy of their operation. For certain applications, nonlinear feedback functions are used by shift registers of span n to generate sequences of lengths up to 2 . The …

    nps Repository record for On the distribution of complexity for de Bruijn sequences (opens in a new tab)

  6. Designing Cryptographic Hash Functions- Architecture and Implementation

    … cryptographic hash function based on Non-Linear Feedback Shift Registers (NLFSRs). Previous works used NLFSRs to create random number generators. We augment this design significantly to build a cryptographic hash function architecture that has an intuitive and modular structure. We perform a …

    tamu Repository record for Designing Cryptographic Hash Functions- Architecture and Implementation (opens in a new tab)

  7. Designing Cryptographic Hash Functions- Architecture and Implementation

    … cryptographic hash function based on Non-Linear Feedback Shift Registers (NLFSRs). Previous works used NLFSRs to create random number generators. We augment this design significantly to build a cryptographic hash function architecture that has an intuitive and modular structure. We perform a …

    tamu Repository record for Designing Cryptographic Hash Functions- Architecture and Implementation (opens in a new tab)

  8. Designing Cryptographic Hash Functions- Architecture and Implementation

    … cryptographic hash function based on Non-Linear Feedback Shift Registers (NLFSRs). Previous works used NLFSRs to create random number generators. We augment this design significantly to build a cryptographic hash function architecture that has an intuitive and modular structure. We perform a …

    tamu Repository record for Designing Cryptographic Hash Functions- Architecture and Implementation (opens in a new tab)

  9. Designing Cryptographic Hash Functions- Architecture and Implementation

    … cryptographic hash function based on Non-Linear Feedback Shift Registers (NLFSRs). Previous works used NLFSRs to create random number generators. We augment this design significantly to build a cryptographic hash function architecture that has an intuitive and modular structure. We perform a …

    tamu Repository record for Designing Cryptographic Hash Functions- Architecture and Implementation (opens in a new tab)

  10. Designing Cryptographic Hash Functions- Architecture and Implementation

    … cryptographic hash function based on Non-Linear Feedback Shift Registers (NLFSRs). Previous works used NLFSRs to create random number generators. We augment this design significantly to build a cryptographic hash function architecture that has an intuitive and modular structure. We perform a …

    tamu Repository record for Designing Cryptographic Hash Functions- Architecture and Implementation (opens in a new tab)

  11. Designing Cryptographic Hash Functions- Architecture and Implementation

    … cryptographic hash function based on Non-Linear Feedback Shift Registers (NLFSRs). Previous works used NLFSRs to create random number generators. We augment this design significantly to build a cryptographic hash function architecture that has an intuitive and modular structure. We perform a …

    tamu Repository record for Designing Cryptographic Hash Functions- Architecture and Implementation (opens in a new tab)

  12. One-dimensional cellular automata and shrinking generators for pseudorandom sequence generation

    Linear feedback shift registers (LFSRs) based on primitive polynomials are commonly used to generate maximum length sequences (m-sequences). These pseudorandom sequences demonstrate desirable randomness properties such as balance, run, and autocorrelation while exhibiting low linear complexity. …

    uvic Repository record for One-dimensional cellular automata and shrinking generators for pseudorandom sequence generation (opens in a new tab)

  13. Topics on Register Synthesis Problems

    … the system based on that given sequence. Linear feedback shift registers (LFSRs) are the most widely studied pseudorandom sequence generators. The LFSR synthesis problem can be solved by the Berlekamp-Massey algorithm, by constructing a system of linear equations, by the extended Euclidean …

    uky-thes Repository record for Topics on Register Synthesis Problems (opens in a new tab)

  14. Two dimensional cellular automata and pseudorandom sequence generation

    Maximum linear feedback shift registers (LFSRs) based on primitive polynomials are commonly used to generate maximum length sequences (m-sequences). An m-sequence is a pseudorandom sequence that exhibits ideal randomness properties like balance, run and autocorrelation but has low linear …

    uvic Repository record for Two dimensional cellular automata and pseudorandom sequence generation (opens in a new tab)

  15. Pseudo-Random Number Generator

    … has been designed and built using linear feedback shift registers to generate rectangular and gaussian distributed numbers. The device has been interfaced to a Nova computer to provide a high speed source of random numbers. The two distributions have been checked with the following tests: …

    mcmaster Repository record for Pseudo-Random Number Generator (opens in a new tab)

  16. Implementation of a design for testability strategy using the Genesil silicon compiler

    … silicon compiler. The basic building block, the shiftable test latch, is described in random logic block form and parallel datapath form. Linear feedback shift registers used as random vector generators and signature analyzers are used in the Built-in Test design. An Automatic Test Generation …

    nps Repository record for Implementation of a design for testability strategy using the Genesil silicon compiler (opens in a new tab)

  17. Stream ciphers and linear complexity

    … of the key streams generated by linear feedback shift registers. An exploration of the probabilistic properties of sequences over $\mathbb{F}_{q}$ is included too. Finally, we define an important parameter $k$-error linear complexity to measure the security of the key streams and discuss …

    nus Repository record for Stream ciphers and linear complexity (opens in a new tab) Download file for Stream ciphers and linear complexity (opens in a new tab)

  18. The partitioning behavior of linear finite state machines and VLSI applications

    Linear Feedback Shift Registers (LFSRs) and Linear Cellular Automata Registers (LCARs) are linear finite state machines which are used in built-in self test as test pattern generators and signature analyzers. We consider the problem of partitioning maximal length machines into a number of smaller …

    uvic Repository record for The partitioning behavior of linear finite state machines and VLSI applications (opens in a new tab)

  19. Modified Geffe test pattern generator for built-in self-test

    … Finite State Machines (FSM) such as Linear Feedback Shift Registers (LFSR), the Geffe generator, a nonlinear FSM, hasn't been frequently studied or used in the scenario of digital system testing. Such machines are used as pattern generators for built-in self-test. LFSRs have become widely …

    uvic Repository record for Modified Geffe test pattern generator for built-in self-test (opens in a new tab)

Page 1 of 3