phc-discussions - Re: [PHC] more woes, last woes

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: <CAOLP8p5QFyCgjZ362Z1V_0nvqOihnnY9c3y7zLed6Q_JwiFBiA@mail.gmail.com>
Date: Tue, 15 Apr 2014 17:50:29 -0400
From: Bill Cox <waywardgeek@...il.com>
To: discussions@...sword-hashing.net
Subject: Re: [PHC] more woes, last woes

Looking at the Lyra2 code again, I see that rowa is XOR-ed with a 64-bit
rotation of the 768-bit state.  I did not model this.  One way to deal with
it is to double the graph size, since two nodes are written at each step
rather than one.  As with Gambit, I'm not sure exactly what to make of the
XOR vs a stronger function.  Knowing the value of the XOR-ed node, and one
input tells me the other, and I'm sure that can be used to improve a
pebbling attack, but I haven't any clue how to enhance the algorithm to
take good advantage of this.

However, I am not a fan of the backwards counting edge destination.  There
are several alternatives that perform well.

Bill

Content of type "text/html" skipped