5 ms·
Actually, after some googling, I've discovered a sequel to bcrypt: http://www.tarsnap.com/scrypt.html http://www.tarsnap.com/scrypt.html This algorithm is not
by cynicalkane 17y ago
Actually, after some googling, I've discovered a sequel to bcrypt:
http://www.tarsnap.com/scrypt.html http://www.tarsnap.com/scrypt.html
This algorithm is not only provably computationally hard, but provably requires a lot of RAM. Since RAM, and the bandwidth thereof, (unlike password-cracking chips) is as cheap to the consumer as it is to the NSA, you can set your RAM requirements very high to give them a very hard time.
- cperciva 17y agoThis algorithm is not only provably computationally hard, but provably requires a lot of RAM Almost right. There is a lower bound on the time-area product, but not a significant lower bound on the area.