3 ms·
> AES256 with 10 million encryption rounds. Applying AES multiple times/rounds doesn't yield anything. AES is not adaptive (like BCrypt) so the cost of brute-f
by rickette 11y ago
> AES256 with 10 million encryption rounds.
Applying AES multiple times/rounds doesn't yield anything. AES is not adaptive (like BCrypt) so the cost of brute-forcing doesn't increase incrementally with the number of rounds.
- distances 11y agoI'm not expert on encryption, so could you clarify this a bit? If the source data is encrypted multiple times, surely then decrypting needs the same number of passes to get the original?
- rickette 11y agoYes, but AES is fast. And since your using the same key over and over again it makes no real difference if you're decrypting once or 10 million times.
- distances 11y agoInteresting. I assume that to mean that the inner decryption loop can be repeated over and over with just a minimal overhead when the same password is being used, compared to the whole process of choosing the next password and setting up the decryption process with that. Anyway, the slowdown is noticeable on my devices with these applications (it's about one second on my laptop), but then again these obviously are not custom-built AES decrypters. This will have to do now.