Quote:
In the case of your algorithm, logic gates change the internal state of the algorithm
I was only talking about the first 4 bytes of my algorithm. This part here:
Code:
CLC
LDA #$45
ADC seed+0
STA seed+0
ADC seed+1
STA seed+1
ADC seed+2
STA seed+2
ADC seed+3
STA seed+3
That part goes through every possible 32 bit state before repeating. The code that follows mixes it all up, and makes it more unpredictable, but that's exactly what it's supposed to do. Keep in mind that the goal is not to have a secure algorithm, or even a building block for it. We just want to generate some good quality random numbers so we can shuffle a deck of cards for solitaire, or determine the path of monsters in a game. A
"good quality" is defined as passing statistical tests in a manner
indistinguishable from true randomness.. As a substitute for true randomness, we can use a known good pseudo random sequence, such as /dev/random or a well accepted cryptographic algorithm such as Chacha-20. If you want to show that my random number generator is not behaving properly, you should run a side-by-side test comparing my method with such a
known good source, and show a consistent difference. Comparing it to a plain LFSR is pointless, because it's not a accepted as known good source of randomness.