2 ms·
A RNG that is reducible to a different believed-hard problem has possible features, so it's not like there could never be a reason for someone to choose this ge
by mindslight 13y ago
A RNG that is reducible to a different believed-hard problem has possible features, so it's not like there could never be a reason for someone to choose this generator. What we could be seeing is the discovery of one failed attempt of a shotgun approach to promulgate insecure primitives. It's hard to know what will happen to become commercially successful, so spray and pray.
Something this blatant does seem like a severe misstep, but perhaps what led to discovery of this case is the wide body of public knowledge on number theoretic crypto. The energy of the public sphere seems mostly devoted to studying problems with interesting mathematical structure. Symmetric crypto has been around a lot longer, and is sufficient for state security purposes, so one would expect the NSA to have a deep analytic understanding of it (hence the differential analysis olive branch). It's not hard to imagine that they'd have ways of creating trapdoor functions out of bit primitives, generating favorable numbers with plausibly-impartial explanations, etc.
- wfunction 13y ago> A RNG that is reducible to a different believed-hard problem has possible features I think you got it backwards... shouldn't you reduce hard problems down to the problem whose difficulty you're trying to understand?
- mindslight 13y agoYep, I misspoke. I simply meant 'is based on', and shouldn't have used big words so cavalierly.