why is it true that complexity theory supersedes any other of the wikipedia requirements for a CSPRNG?
https://circumstances.run/@hipsterelectron/117656510949610702
@dragonfi btw, academic cryptographers are evil people and the oft-stated ~very complex~ requirements for a secure CSPRNG are basically intended to obfuscate the issue. a CSPRNG needs to constitute an NP complete problem, that's it
because, as we recall, NP complete problems are the biggest problems in NP (the fact that they are also suspected to be the hardest is in fact the ENTIRE fucking P vs NP problem)