You are on page 1of 22

Chaos-Based Bitwise Dynamical Pseudorandom Number

Generator on FPGA

By rohit pandey
PSEUDORANDOM NUMBER GENERATOR

● Desired properties of a good generator.


● Seed selection.
● Linear-congruential generators.

WHY DO WE USE PSEUDORANDOM NUMBER GENERATOR

● To improve statistical properties.


● Its output sequence is computationally unpredictable.
METHODLOGY[4]

Receive input image

Process input image using encoder neural network to generate latent


variable data

Generate compressed representation of input image from latent variable


data

Receive compressed representation

Decode compressed representation

Generate values of remaining latent variables

Figure1.Types of Random Number


GENERATION OF RANDOM NUMBERS

Random number

Xn=a^n mod m

Xn=aXn-1 mod m

Pseudo random number

xi = f (xi−1, γ1) for k1 element

xi = f (xi−1, γ2) for k2 element

m=sigma(ki)
Figure2.Generation of PRNG
APPLICATION OF
PRNG
Statistics-Statistical practice is based on statistical theory which is, itself, founded on the
concept of randomness. Many elements of statistical practice depend on randomness via
random numbers.

Cryptography-A ubiquitous use of unpredictable random numbers is in cryptography


which underlies most of the schemes which attempt to provide security in modern
communications.

Gambling- Outcome of the wager is often immediate, such as a single roll of dice, a spin
of a roulette wheel, or a horse crossing the finish line which is based on randomness,etc.
Research Papers
1. Miguel Garcia-Bosque , Adrián Pérez-Resa , Carlos Sánchez-Azqueta, “Chaos-
Based Bitwise Dynamical Pseudorandom Number Generator on FPGA”
2. Jovan Dj. Golic, Member, “New Methods for Digital Generation and
Postprocessing of Random Data”
3. Amir Mohammad Amiri, Abdelhakim Khouas, and Mounir Boukadoum, Senior
Member, IEEE “Pseudorandom Stimuli Generation for Testing Time-to-Digital
Converters on an FPGA”
4. Chaoyang Li1, Qin Wang1*, Jianfei Jiang1, Nin Guan2 “A Metastability-Based
True Random Number Generator on FPGA”
5. David B. Thomas, Member, IEEE, and Wayne Luk, Fellow, IEEE“Multiplierless
Algorithm for Multivariate Gaussian Random Number Generation in FPGAs”
TITLE:Chaos-Based Bitwise Dynamical Pseudorandom Number Generator on FPGA
AUTHOR:Miguel Garcia-Bosque,Adrián Pérez-Resa,Carlos Sánchez-Azqueta
PUBLISHER:IEEE-2019

A new pseudorandom number generator (PRNG) based on the logistic map has
been proposed. To prevent the system to fall into short period orbits as well as
increasing the randomness of the generated sequences, the proposed algorithm
dynamically changes the parameters of the chaotic system.Pseudorandom
number generators (PRNG) have many applications among diverse fields such as
cryptography , communications or procedural generation.But we have to decide
seed first.
TITLE:New Methods for Digital Generation and Postprocessing of Random Data
AUTHOR:Amir Mohammad Amiri, Abdelhakim Khouas
PUBLISHER:IEEE-2006
1. The output of a random number generator (RNG) is typically a binary sequence which is
required to be unpredictable in the information-theoretic sense.
2. A purely random RNG output sequence can then be obtained by further postprocessing of
the generated raw binary sequence.
3. In this we use fibonacci ring oscillator and galois ring oscillator this both are exor and
passed through D flip flop after this binary output appear.
4. The postprocessing can provide both randomness extraction and computationally secure
speed increase of input random data.
TITLE:Pseudorandom Stimuli Generation for Testing Time-to-Digital Converters on an
FPGA”
AUTHOR:Amir Mohammad Amiri, Abdelhakim Khouas
PUBLISHER:IEEE-2009

As a first step to investigate the pseudorandomness of the generated interpulse


intervals, the behavior of the PRpG was verified by software emulation under ideal
conditions (untimed functional model), using LFSR configurations of different
widths. The software emulation results presented in this section are based on a 16-
bit LFSR with primitive polynomial.
TITLE:A Metastability-Based True Random Number Generator on FPGA
AUTHOR:Chaoyang Li1, Qin Wang1*, Jianfei Jiang1, Nin Guan2
PUBLISHER:IEEE-2006

The operation of this TRNG is simple in theory: two inverters are connected to each
other’s inputs. This type of configuration might usually be used as a refresher to
hold the output for a dynamic latch to stop leakage, but since both are connected to
Vdd through clock-controlled transistors, both the inputs and outputs will go high
when the clock goes low. When the clock goes high and disconnects the Vdd, both
sides force the other to lower to half Vdd due to both inverters acting on each
other’s input. This halfway point is the metastable state and the TRNG will stay
here until thermal noise causes one inverter to overpower the other, forcing the
output of the stronger inverter to go to zero and causing its input to swing to one.
TITLE:Multiplierless Algorithm for Multivariate Gaussian Random Number Generation
in FPGAs
AUTHOR:David B. Thomas,Wayne Luk, Fellow
PUBLISHER:IEEE-2013

The multivariate Gaussian distribution is used to model random processes with


distinct pair-wise correlations, such as stock prices that tend to rise and fall
together. Multivariate Gaussian vectors with length n are usually produced by first
generating a vector of n independent Gaussian samples, then multiplying with a
correlation inducing matrix requiring O(n2) multiplications. This paper presents a
method of generating vectors directly from the uniform distribution, removing the
need for an expensive scalar Gaussian generator, and eliminating the need for any
multipliers.
TITLE:Hardware Design of Chaotic Pseudo-Random Number Generator
Based on Nonlinear Feedback Shift Register.
AUTHOR:Maryam Hematti1, Arash Ahmadi2, Seyed Vahab Makki1, Majid Ahmadi2
PUBLISHER:IEEE-2010

To improve output quality and characteristics such as period and numerical


complexity, this paper suggests a combination of NFSR and pseudo-random chaos
generator. In this approach, a 10-bit pseudo-random chaos generator and a 10-bit
parallel Fibonacci NFSR is utilized (for higher speed).

To improve output quality and characteristics such as period and numerical


complexity, this paper suggests a combination of NFSR and pseudo-random chaos
generator. In this approach, a 10-bit pseudo-random chaos generator and a 10-bit
parallel Fibonacci NFSR is utilized (for higher speed).
TITLE:Pseudo-Random Number Generator Based on Binary and Quinary Maximal-
Length Sequences
AUTHOR:HEINRICH PANGRATZ AND HANS WEINRICHTER
PUBLISHER:IEEE-2006

A new pseudo-random generator for decimal numbers is presented. A sequence of


decimal digits is obtained by combining a binary and a quinary maximal-length
sequence generated by feed-back shift-register circuits.This paper presents a new
and fast random generatorwhich is based on shift-register sequences and which
generates the digits 0 to 9 in a pseudo-random mode.For this, we use (1) and take
the elements x(n) and coefficients ai from GF(5), that is from the set of integers 0
to4. Addition and multiplication are carried out modulo 5. To store the elements 0 to
4 a quinary shift register is used.
Figure3..Quinary feedback shift registor

x(n+1)=(4x(n)+3x(n-6))mod5
TITLE:PSEUDO RANDOM NUMBER GENERATOR BASED ON HOPFIELD
NEURAL NETWORK
AUTHOR:YU-HUA WANG, ZHI-DONG SHEN, HUAN-GUO ZHANG
PUBLISHER:IEEE-2006

In this paper, we propose a novel pseudo-random number generator based on


Hopfield Neural Network techniques. It is well known that Hopfield Neural Network
posses very interesting function approximation capabilities making them a very
powerful tool in many scientific disciplines
Figure.Hopfield Neural Network
TITLE:Pseudo-Random Number Generator Based on Irrational Numbers
AUTHOR:Luka Milinkovic, Marija Anti ́ c and Zoran ́ Ci ˇ caˇ
PUBLISHER:IEEE-2011

There are various ways to express the dependency between element values. One of
the important categories of PRNGs are the linear congruential number generators.
In this category of generators, the value of the element zi is calculated using the
formula:

zi = (a · zi−1 + b) mod m
xi = (xi−1 · qi−1) mod m.
m, qi−1 ∈ Q, m > 0, qi−1 > 1, x0 ∈
I. Where q(i) is rational where
first x(i) is irrational .Here, m = 1 and N = 100, 000 for both generated
sequences,but the parameters K1, K2 and the seed x0 = K3/c are different.
Pseudo-Random Number Generator Based on Irrational Numbers

where i ∈ {1, 2,...,N}, and N is the maximum number


of
elements xi. The values m, M, K1 and K2 are the
parameters
of the generator. The parameter m is the positive
integer, m ∈
N\{0} (where N is the set of natural numbers).

x1=(x0*(M-1)/k2)mod m
TITLE:Verification of the GREAT Total Data Readout System Using Pseudo Random
Pattern Generator
AUTHOR:P. J Coleman-Smith
PUBLISHER:IEEE-2006

Total Data Readout (TDR) is a powerful data acquisition tool developed for use with
Recoil Decay Tagging (RDT) experiments on the GREAT (Gamma, Recoil,
Electron, Alpha Tagging) spectrometer. RDT experiments correlate prompt
radioactive decays detected at the target position with subsequent decays of recoiling
reaction products implanted in GREAT, located at the focal plane of the RITU recoil
separator, several microseconds later. TDR uses independent channels associated in
a software event builder based on timestamps to form a single time ordered data
stream.
REFERENCES
[1]Chaos-Based Bitwise Dynamical Pseudorandom Number Generator on FPGA
https://www.researchgate.net/publication/328896591_Chaos-
Based_Bitwise_Dynamical_Pseudorandom_Number_Generator_on_FPGA

[2]New Methods for Digital Generation and Postprocessing of Random Data


https://www.researchgate.net/publication/3049206_New_Methods_for_Digital_Generation_and_Postprocessing_of_Random_Data

[3]Pseudorandom Stimuli Generation for Testing Time-to-Digital Converters on an FPGA


https://www.youtube.com/watch?v=8U_VPGjmKb0

[4]True Random Number Generator on FPGA


https://core.ac.uk/download/pdf/144146883.pdf

You might also like