A 25-gigabyte "point obfuscation" challenge "using security parameter 60" was announced at the Crypto 2015 rump session; "point obfuscation" is another name for password hashing. This paper shows that the particular matrix-multiplication hash function used in the challenge is much less secure than previous password-hashing functions are believed to be. This paper's attack algorithm broke the challenge in just 19 minutes using a cluster of 21 PCs.
Keywords: symmetric cryptography, hash functions, password hashing, point obfuscation, matrix multiplication, meet-in-the-middle attacks, meet-in-many-middles attacks
Original language | English |
---|
Publisher | IACR |
---|
Number of pages | 27 |
---|
Publication status | Published - 2015 |
---|
Name | Cryptology ePrint Archive |
---|
Volume | 2015/151 |
---|