5 ms·
1. Generate a random number. 2. s- or bcrypt it. 3. Encrypt the data with the result of step 2. 4. Give people most of the random number, minus N bits at the en
by romaniv 13y ago
1. Generate a random number.
2. s- or bcrypt it.
3. Encrypt the data with the result of step 2.
4. Give people most of the random number, minus N bits at the end. (And tell them how many bits they are missing.)
They will have to run s/bcrypt (N^2)/2 time to get your date. Am I missing anything?
- karl_gluck 13y agoThe issue is that you can parallelize the "unlocking" operation. So, if one person is attempting to unlock, they solve in 10 years. If two people attempt, it's solved in 5 years. If the NSA puts all their computers on it, it takes 1 second. The author is proposing methods that are forcibly sequential.