phc-discussions - Re: [PHC] Re: BlaMka loses entropy

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: <CAOLP8p4gerST0=9jOtBDVa+JmN7wQX-M1kuRJH6mS_k2=n0rSw@mail.gmail.com>
Date: Mon, 19 Oct 2015 11:52:49 -0700
From: Bill Cox <waywardgeek@...il.com>
To: "discussions@...sword-hashing.net" <discussions@...sword-hashing.net>
Subject: Re: [PHC] Re: BlaMka loses entropy

On Mon, Oct 19, 2015 at 11:45 AM, Dmitry Khovratovich <
khovratovich@...il.com> wrote:

> Even if you were right, this property would not be a problem thanks to the
> 8192-bit width of permutation P. It would be highly unlikely that any of
> 2^256 possible Argon2 executions collide due to such property.
>

Probably true, but it does make the security proof simpler.  It's nice to
know exactly which step(s) results in entropy loss.  I just proved to
myself that BlaMka does not loose entropy.  It's a nice property to have in
the inner hashing function.

Bill

Content of type "text/html" skipped