A daemon that replenishes the /dev/random pool
In practice, the collection sequence consists of a branch-heavy calculation that reads the processor time stamp readings into an data array as it permutes the array contents. The data array is sized to be twice that of the level 1 data cache and the calculation constructed so that 2 cache blocks are party to each output calculation. The calculation would be cyclical if not for the effects of other unrelated hardware events on the time stamp counter increments.
In a hurry? Add it to your Download Basket!
What's New in This Release:
- This version fixes documentation and sample file issues in the 1.9.0 release.