phc-discussions - Re: [PHC] Re: Attack on Argon2i?

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: <CAOLP8p5L503UySAVuqf8_-DNq=QMmvnWJRHnFeyJM=Kqq-3PUA@mail.gmail.com>
Date: Sat, 16 Jan 2016 22:18:38 -0800
From: Bill Cox <waywardgeek@...il.com>
To: "discussions@...sword-hashing.net" <discussions@...sword-hashing.net>
Subject: Re: [PHC] Re: Attack on Argon2i?

On Sat, Jan 16, 2016 at 6:23 PM, Henry Corrigan-Gibbs <henrycg@...nford.edu>
wrote:

> Hi Krisztián,
>
> I am one of the authors of the Balloon Hashing paper. Thanks for taking a
> look at it!
>
>
Thanks for taking part in this discussion.  The attack with 1/e memory was
pretty awesome!  I never looked at cases where t_cost > 1.

While your algorithm is cool, and showed a weakness in Argon2i, I still
think your algorithm is too slow.  How fast can you fill memory?
Memory*time defense goes as the square of this number.  Some good
algorithms fill 4MiB in 1ms.

Bill

Content of type "text/html" skipped