Christoph Rabel 3 Months Ago - Edited "The only problem for us, as the hashing algorithms get more complex, they typically always get slower..." That's actually the idea. A hashing algorithm SHOULD be expensive in terms of computing time and resources. It must be costly for an attacker to do a brute force attack. So, while this has the downside of increasing the login time slightly, this is a feature, not a bug. Of course, if Bouncy Castle is indeed faster, there is no reason not to use it. That's a nice find there! I mean, an attacker will use the fastest implementation of a given algorithm anyway. Please sign in to reply. Reply as... Cancel David H Nebinger Christoph Rabel 3 Months Ago - Edited OpenSSL apparently as a super-fast implementation of PBKDF2WithHmacSHA1, but to get there you'd need some JNI skills and know how to statically link in the necessary libraries. I've started to try and implement it, but it's been years since I've done JNI so it's been a slow process... However, that's the crux of my argument; just because it is getting more complex, that doesn't mean we shouldn't be looking for better/optimized implementations which can complete the same amount of work in a shorter time period. Please sign in to reply. Reply as... Cancel
David H Nebinger Christoph Rabel 3 Months Ago - Edited OpenSSL apparently as a super-fast implementation of PBKDF2WithHmacSHA1, but to get there you'd need some JNI skills and know how to statically link in the necessary libraries. I've started to try and implement it, but it's been years since I've done JNI so it's been a slow process... However, that's the crux of my argument; just because it is getting more complex, that doesn't mean we shouldn't be looking for better/optimized implementations which can complete the same amount of work in a shorter time period. Please sign in to reply. Reply as... Cancel