Hacker News new | past | comments | ask | show | jobs | submit login

Today I learned that there are other aspects for CSPRNG beside the stronger definition of unpredictability. Wikipedia mentions inability to calculate previous values in case the hidden internal state gets revealed. So I assumed that top question was intentionally asking about weaker definition of predicatability not PRNG that have good enough unpredictability for CSPRNG but doesn't match other requirements.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: