phc-discussions - Re: [PHC] Argon2 modulo division

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: <CA+hr98Eb_kMwg8cOzp5mD7qi-CSRx8zEKVbLwQw=0kokrsSHPg@mail.gmail.com>
Date: Wed, 29 Apr 2015 16:07:37 +0200
From: Krisztián Pintér <pinterkr@...il.com>
To: "discussions@...sword-hashing.net" <discussions@...sword-hashing.net>
Subject: Re: [PHC] Argon2 modulo division

On Wed, Apr 29, 2015 at 3:51 PM, Dmitry Khovratovich
<khovratovich@...il.com> wrote:
> All the tradeoff methods I have tried accumulated highest penalties in
> latest blocks. Therefore, the latest blocks should be asked rather
> more often - but not always (sliding window), as then the attacker
> would not store the first blocks at all.

gambit's solution is a sliding window but xor into memory, which means
all recomputation graphs go back to the origin.