Courses

# Cellular-Automata Notes | EduRev

## : Cellular-Automata Notes | EduRev

``` Page 1

Cellular Automata III
Based mostly on lectures by Dr.
Richard Spillman
Page 2

Cellular Automata III
Based mostly on lectures by Dr.
Richard Spillman
OUTLINE
?Random Number
Generation

?A Cellular Automata
Cipher System

?Computation on Cellular
Automata

Page 3

Cellular Automata III
Based mostly on lectures by Dr.
Richard Spillman
OUTLINE
?Random Number
Generation

?A Cellular Automata
Cipher System

?Computation on Cellular
Automata

Random Number Generation
?Random numbers are required for a wide range of
applications
?Cryptology
?Testing
?Modeling and Simulation
?Genetic Algorithms
?. . .

?Yet, true random numbers are very difficult to find
?Computer based random number generators are really
pseudo-random number generators because they
eventually repeat
Page 4

Cellular Automata III
Based mostly on lectures by Dr.
Richard Spillman
OUTLINE
?Random Number
Generation

?A Cellular Automata
Cipher System

?Computation on Cellular
Automata

Random Number Generation
?Random numbers are required for a wide range of
applications
?Cryptology
?Testing
?Modeling and Simulation
?Genetic Algorithms
?. . .

?Yet, true random numbers are very difficult to find
?Computer based random number generators are really
pseudo-random number generators because they
eventually repeat
Current Random Number
Generators
?There are two typical approaches to random number
generation
?Use of a mathematical relationship
?Use of a linear feedback shift register (LFSR)

?A common mathematical relationship is of the form
x’ = (ax + b) mod n
x’ = (11x + 17) mod 61
Random Numbers
Seed              13
38
8
44
Page 5

Cellular Automata III
Based mostly on lectures by Dr.
Richard Spillman
OUTLINE
?Random Number
Generation

?A Cellular Automata
Cipher System

?Computation on Cellular
Automata

Random Number Generation
?Random numbers are required for a wide range of
applications
?Cryptology
?Testing
?Modeling and Simulation
?Genetic Algorithms
?. . .

?Yet, true random numbers are very difficult to find
?Computer based random number generators are really
pseudo-random number generators because they
eventually repeat
Current Random Number
Generators
?There are two typical approaches to random number
generation
?Use of a mathematical relationship
?Use of a linear feedback shift register (LFSR)

?A common mathematical relationship is of the form
x’ = (ax + b) mod n
x’ = (11x + 17) mod 61
Random Numbers
Seed              13
38
8
44
Linear Feedback Shift Register
?A LFSR is a hardware random number
generator
?A shift register holds a data word and can shift it
to the left or right one bit position on each clock
pulse
1 0 1 1 1 0
1 0
1
1 1 1
0 0 1 1 1
0
1
1
1 1 1 1 1 1 0 0
0
0
0 0 1 1
1 1 1 1
```
Offer running on EduRev: Apply code STAYHOME200 to get INR 200 off on our premium plan EduRev Infinity!