Just this morning a means occurred to me for how I might generate a most extremely unpredictable pseudo-random number for encryption purposes.
1. Get the Nth pseudo-random from a fixed seed.
2. Permute it into a 64-element Knapsack key.
3. Obtain the next-in-sequence pseudo-random.
4. Encrypt that with the key from step 2.
5. Repeat steps 1 and 2 for a new key.
6. Decrypt the result of step 4 via the new key.
And were I truly paranoid, I could perform the above sequence twice, XOR-ing the paired results together.
I now have this working in Forth. Looks good so far. Aside from running a tad slow, can anyone cite just cause for the concept being daft?