3 ms·
I was referring to assumptions that let one equate breaking urandom with breaking arbitrary cryptosystems in other ways. examples: 1. Breaking urandom's constr
by mindslight 11y ago
I was referring to assumptions that let one equate breaking urandom with breaking arbitrary cryptosystems in other ways. examples:
1. Breaking urandom's construction is much less likely than breaking a less-trodden hardware device.
2. If hashes in general are broken, then any crypto of interest is also broken (counter example: non-complexity based crypto like a one-time pad (note: Do NOT construe this as any sort of practical endorsement of "one time pads". If you do not understand the concept of malleability, then forget this entire comment exists and go read up on that instead!)).
3. Backdooring RDRAND is equivalent to backdooring the entire CPU (counter: a model of auditability that constrains the complexity of a backdoor)
These assumptions are mostly reasonable, but they are assumptions nonetheless.
Embedded systems do suffer from a demonstrable lack of entropy. Studying techniques for hardware entropy collection is interesting in its own right, which is why it's disappointing that this page seems more focused on productizing their device as a black box USB stick rather than concentrating on open review.