ervoice.blogg.se

This makes it difficult and expensive for attackers to perform parallel computations on a large scale, which is a common technique used by quantum computers to speed up their calculations.Īdditionally, Argon2 uses a technique called "data-dependent addressing," which means that the memory addresses used in the computation depend on the input data. Memory-hardness means that the algorithm requires a large amount of memory to perform its computations. One reason why Argon2 is believed to be safe from quantum computing attacks is because it uses a technique called "memory-hardness. "Argon2 is a password hashing function that is designed to be resistant to various attacks, including attacks by quantum computers. Please keep in mind that for proper cracking rigs with a lot more GPU power the difference between PBKDF2 cracking and Argon2 cracking will be even greater! PBKDF2 600.000 iterations (the new default)Īrgon2 - t=3, m=64.000, p=4 (Argon2 defaults on Bitwarden)Īrgon2 Bitwarden defaults - 1.8 million USDĪrgon2 (t=10, m=512MB, p=4) - 53.7 million USDĪrgon2 Bitwarden defaults - 16.2 million USDĪrgon2 (t=10, m=512MB, p=4) - 486.5 million USD PBKDF2 100.000 iterations (the old default and the basis for 1password's cracking cost contest) So for a Laptop with AMD Ryzen 7 5800H and RTX 3060: Since I couldn't find any benchmark directly comparing these 2 on the same hardware, I decided to run some tests myself. I've been looking for some hard numbers comparing the cracking resistance of PBKDF2 and Argon2 as password-based key derivation functions. PBKDF2 vs Argon2 - Finally some hard numbers