Earlier quoted context omitted.
One time pads used properly are theoretically perfectly unbreakable. The problem is making sure no one ever uses the same 'pad'/keystream twice, that your pad generation is actually random, and that the pads never fall into the hands of your adversaries. (or if they do you've been diligent about completely destroying the used pads and the other end of your communications doesn't use the captured set of pads) They're…
> that your pad generation is actually random The one thing that stood out to me with the original blog post and a quick glance at the code was that it appeared as if the pad was certainly not actually random. Could anyone that has actually understood it a bit more confirm or reject this? Edit: It seems that the random generation can be found starting here https://github.com/Vulacode/RANDOM/blob/d6a1a1d694b22e6a115b.…
In BASIC, the word "RANDOMIZE" sets the seed for the RND function, and you'll find it's initially dependant on time (including the typing speed of the user):
https://github.com/Vulacode/RANDOM/blob/main/RANDOM.BAS#L295
It then is reinitialised periodically by mixing in run time (which is highly variable due to microprocessor limitations) and checksums of previous parts of the stream:
https://github.com/Vulacode/RANDOM/blob/main/RANDOM.BAS#L319
The RAND[123] appears to be Bennett Fox's Algorithm 647, which was designed for simulation purposes (statistical randomness), and is based on Lewis-Goodman-Miller's construction from 1969, so it had a great deal of scrutiny.
I think this would have been state of the art in the late 1980s.