Recently starting to immerse myself into cryptography, the problem concerning the generation of true randomness being unachievable for computers at this point was raised. If computers were able to measure temperature, or measure time in nanoseconds, some randomness could be acquired. This is however not the case.
A somewhat new, perhaps even partially unexplored way of attacking computer systems consists of reading memory many (many!) times, abusing quantum effects in order to try to flip adjacent bits in memory. By my understanding this is called bit flipping, and the concept has already been proven in what is called a bitsquatting attack (https://arstechnica.com/gadgets/2021/03/windows-com-bitsquatting-hack-can-wreak-unknown-havoc-on-pcs/ ).
My question is: Would it then not be possible to acquire a random number by reading a pre assigned memory block over and over and over again, and then take the adjacent memory block bits as the result (this would be a unforecastable string of 1s and 0s)? Is this unfeasible due to the computational requirements of reading the data this many times? Could it cause memory corruption beyond the intended adjacent blocks as well?
If there is anyone who has more documentation about these mechanics, or any complemented research, this would be much appreciated!
complimented research, see random.org which is a random number generator that uses entropy derived from atmospheric noise.