3 ms·
> The proofs he cites are not applicable to his since he has a fixed permutation. This is something I'm concerned about (hence https://news.ycombinator.com/ite
by clarry 7y ago
> The proofs he cites are not applicable to his since he has a fixed permutation.
This is something I'm concerned about (hence https://news.ycombinator.com/item?id=22451307 https://news.ycombinator.com/item?id=22451307), but I lack the know-how to demonstrate the difference.
> I get time (and remember) later, I've written some SAT solver code to explicitly find holes in PRNGs, and I'll try to dig it out and analyze the cycles in this fixed permutation.
Thanks, I would love to see this. Can I expect to see the results on your blog or here or somewhere else?
Presumably you've done this for other PRNGs in the past. If you've got links to share, I'd like to take a look, and hopefully learn a thing or two. :-)
- ChrisLomont 7y agoI’ve done it for crypto work, and to find or prove impossible certain mixing functions for PRNG work. Knuth fascicles on Boolean Functions and SAT solvers give a good foundation for this type of work. Do all or most of his related exercises to get going. Unfortunately, I rarely write stuff up. Too busy doing :) Writing up well takes considerable time away from making things.