Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
tlrobinson
on March 8, 2015
|
parent
|
context
|
favorite
| on:
The $5000 Compression Challenge
Aren't cryptographically secure PRNGs supposed to produce outputs indistinguishable from truly random numbers?
leni536
on March 8, 2015
[–]
CSPRNG generated sequences can be trivially compressed. You just have to know the seed and the length to reproduce the sequence. However getting the seed from the sequence is unfeasible but theoretically possible by bruteforce.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
