phc-discussions - Initial multiply-compute-hardened Catena-3 benchmark

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite for Android: free password hash cracker in your pocket

[<prev] [next>] [thread-next>] [day] [month] [year] [list]

Message-ID: <CAOLP8p46ULDwXZ6gaf9UQHoZQU2fAHB095c2SnMdqs6iUS=d-A@mail.gmail.com>
Date: Thu, 23 Jan 2014 14:10:11 -0500
From: Bill Cox <waywardgeek@...il.com>
To: discussions@...sword-hashing.net
Subject: Initial multiply-compute-hardened Catena-3 benchmark

I've signed in a branch of Catena that replaces the hashing function
with a simple multiply, OR, and ADD.  I also made it hash blocks of
4096 bytes of memory at once rather than 64.  The result runs 13X
faster, filling 1GB of memory in 1.37 seconds on a single thread.

In comparison, NoelKDF hashes 1GB in 0.42 seconds on 1 thread, or 3.2X
faster.  However, there's a TMTO attack against NoelKDF that requires
almost the same runtime, but only uses 0.5GB.  There is no such attack
against Catena-3, IMO.

Taking that into account, Catena-3 takes only about 40% longer to hash
the same memory as an attacker optimized version of NoelKDF.  I'm
leaning towards Catena-3 now, for timing attack resistance, at least
if we have an option for a fast hash in the inner loop.

Bill