phc-discussions - Re: [PHC] Question about saturating the memory bandwidth

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-prev] [thread-next>] [day] [month] [year] [list]

Message-ID: <52D953D6.5090202@bindshell.nl>
Date: Fri, 17 Jan 2014 08:01:26 -0800
From: Jeremi Gosney <epixoip@...dshell.nl>
To: discussions@...sword-hashing.net
Subject: Re: [PHC] Question about saturating the memory bandwidth

On 1/17/2014 6:35 AM, Bill Cox wrote:
> attacker only gains a 2X advantage. That's very good, really
> outstanding, IMO. 
[...]
> Assuming the defender has a high-end graphics card, he can get better
> protection using it.

It is highly improbable that a defender will ever have a high-end GPU,
and especially not one that is equal to the type of GPU most attackers
will use. And if we have done our jobs right, the algorithm will be
highly resistant to acceleration. It should be considerably slower on
GPU than CPU, if not impossible to implement on GPU. The goal is to give
defenders the advantage, or at the very least to level the playing field.