Search

Approximating chaotic systemsReply
I only recently started reading about PRNGs. I was surprised to learn that some PRNGs that are considered cryptographically secure aren't one large cycle in state space, but instead have some short cycles. That indicated to me that if the PRNG was seeded to start in those short cycles, the PRNG wouldn't be random enough. I'm aware of some satisfiability modulo theory libraries used to solve for the seed given PRNG output. But in those cases, you know the PRNG because it's in the code, and th
Aug 23, 2023, 11:21 am - Wavepack - Mathematics Forum