Pseudo Random Numbers from a Linear Feedback Shift Register

If we had an infinitely long list of random ones and zeros, we could generate a random number by jumping to an arbitrary spot on that list and reading as many bits as we need. We can't store an infinitely long list of ones and zeros or even one that's long enough to seem infinite. What we can do is generate an incredibly long list using a linear feedback shift register.

Timestamps
00:00 | Intro
00:15 | Tarnoff's second program...ever
01:11 | Using tremendously long sequences to hide deterministic behavior
02:40 | Using a linear feedback shift register to simulate storing a sequence
02:51 | Review of linear feedback shift registers
04:26 | Reasons to use an LFSR to generate pseudo random numbers
07:01 | A 15-bit pseudo random sequence from an LFSR
11:16 | A 255-bit pseudo random sequence from an LFSR

Hashtags
#prng #lfsr #randomnumbers