scholarly journals Gaussian Pseudorandom Number Generator Based on Cyclic Rotations of Linear Feedback Shift Registers

Sensors ◽  
2020 ◽  
Vol 20 (7) ◽  
pp. 2103
Author(s):  
Guillermo Cotrina ◽  
Alberto Peinado ◽  
Andrés Ortiz
Keyword(s):  
Simulated Annealing Algorithm ◽  
Low Cost ◽  
Linear Feedback ◽  
Pseudorandom Number Generator ◽  
Implementation Cost ◽  
Linear Feedback Shift Registers ◽  
Annealing Algorithm ◽  
Feedback Shift Registers ◽  
Optimal Configurations ◽  
Complex Algorithm

This paper presents a new proposal to generate optimal pseudorandom numbers with Gaussian distribution. The generator is especially designed for low-cost hardware implementation, although the software version is also considered. For this reason, Linear Feedback Shift Registers in conjunction with cyclic rotations are employed. The proposal presents a low implementation cost and overcomes the limitations of the previous Gaussian generators based on linear feedback shift registers by means of a less complex algorithm to find optimal configurations. As a consequence, it turns into a really usable generator. Moreover, a further improvement, based on the simulated annealing algorithm, is applied in order for the random values to be better adjusted to the normal distribution.

scholarly journals Gaussian Pseudorandom Number Generator Using Linear Feedback Shift Registers in Extended Fields

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 556
Author(s):  
Guillermo Cotrina ◽  
Alberto Peinado ◽  
Andrés Ortiz
Keyword(s):  
Gaussian Distribution ◽  
Current Trend ◽  
Equivalent Model ◽  
Linear Feedback ◽  
Pseudorandom Number Generator ◽  
Linear Feedback Shift Registers ◽  
Extended Field ◽  
Feedback Shift Registers ◽  
Uniformly Distributed Sequences ◽  
The One

A new proposal to generate pseudorandom numbers with Gaussian distribution is presented. The generator is a generalization to the extended field GF(2n) of the one using cyclic rotations of linear feedback shift registers (LFSRs) originally defined in GF(2). The rotations applied to LFSRs in the binary case are no longer needed in the extended field due to the implicit rotations found in the binary equivalent model of LFSRs in GF(2n). The new proposal is aligned with the current trend in cryptography of using extended fields as a way to speed up the bitrate of the pseudorandom generators. This proposal allows the use of LFSRs in cryptography to be taken further, from the generation of the classical uniformly distributed sequences to other areas, such as quantum key distribution schemes, in which sequences with Gaussian distribution are needed. The paper contains the statistical analysis of the numbers produced and a comparison with other Gaussian generators.

scholarly journals What Causes to Tune a Condition of Exactly Identical Fault-Masks Behaviors in an LFSR based BIST Methodology

2017 ◽  
Vol 10 (04) ◽  
pp. 710-717
Author(s):  
A. Ahmad ◽  
D. Al Abri ◽  
S. S. Al Busaidi ◽  
M. M. Bait-Suwailam
Keyword(s):  
Linear Feedback ◽  
Test Sequence ◽  
Linear Feedback Shift Registers ◽  
Random Test ◽  
Signature Analyzer ◽  
Simulation Results ◽  
Feedback Shift Registers ◽  
Self Test ◽  
Sequence Generator ◽  
Feedback Connections

The authors show that in a Built-In Self-Test (BIST) technique, based on linear-feedback shift registers, when the feedback connections in pseudo-random test-sequence generator and signature analyzer are images of each other and corresponds to primitive characteristic polynomial then behaviors of faults masking remains identical. The simulation results of single stuck-at faults show how the use of such feedback connections in pseudo-random test-sequence generator and signature analyzer yields to mask the same faults.

Sign in / Sign up

Export Citation Format

Share Document