phc-discussions - Re: [PHC] Memory-hard proof of work with fast verification (CPU Hash)

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: <CAOLP8p4_AcKTP74WzHsc7V+5m5i3RJLCHVzKnTvLfCEnBFTB=A@mail.gmail.com>
Date: Sat, 4 Jul 2015 13:00:10 -0700
From: Bill Cox <waywardgeek@...il.com>
To: "discussions@...sword-hashing.net" <discussions@...sword-hashing.net>
Subject: Re: [PHC] Memory-hard proof of work with fast verification (CPU Hash)

On Sat, Jul 4, 2015 at 11:45 AM, Solar Designer <solar@...nwall.com> wrote:

> > With Yescrypt's further GPU defense, I think it would be fine.
>
> Sure, but this makes your 512 MB ROM sort of irrelevant for GPU attacks.
> They can have that 512 MB in their GPU card's RAM, and will run almost as
> fast (for a trivial enhancement of scrypt) or just as slow (for yescrypt
> with pwxform).
>
> Alexander
>

I guess I am more concerned about ASICs.  People still enjoyed LiteCoin
mining with GPUs, but ASICs ruined the BitCoin party for a lot of people.

I _think_ the ROM defends well against an ASIC attack.  So would
mutiplication chains and the random small memory I/O operations.  However,
an ASIC attack will probably run at it's I/O bandwidth to memory.

Bill

Content of type "text/html" skipped