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  PHC 
Open Source and information security mailing list archives
 
Hash Suite for Android: free password hash cracker in your pocket
[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Date: Wed, 7 Aug 2013 11:57:37 +0200
From: CodesInChaos <codesinchaos@...il.com>
To: discussions@...sword-hashing.net
Subject: Re: [PHC] A (naively?) simple PHC submission using hash chains

The complete algorithm with a sequential implementation runs in pmem time
using pmem memory even with efficient prepending.
=> cost is pmem^2 using (memory+cores)*time as cost metric.

One can argue that (memory+cores)*time is only a good metric for an
attacker, not for the defender because the defender is often time-bound,
not memory bound.
In that case using pmem as cost for the defender might  be a better metric,
as long as they don't run out of RAM.
But even when you compare with equal defender time, this algorithm isn't as
good as scrypt, since scrypt costs an attacker pmem^2,
but this algo costs the attacker pmem^{3/2}, or even less.

 (I'm using ptime=1 here, since ptime isn't relevant for this attack)

Content of type "text/html" skipped

Powered by blists - more mailing lists