26 ms·
The problem here is that the amount of work needed to generate the key is not known beforehand either. I think a better approach (that would also not leak bits
by simias 13y ago
The problem here is that the amount of work needed to generate the key is not known beforehand either.
I think a better approach (that would also not leak bits of the key) would be to say "hash until the hash of the hash is xxx". So basically you hash until you get xxx and then take the previous iteration's result as a key.
- zeckalpha 13y agoGiven a sequence of N hashes, you could select any hash A as the initial hash, any hash B as the key, and the successor of B (C) as the key to the key. After choosing B and C, choose an A whose distance to B and C is proportional to the amount of work you wish to require.