phc-discussions - Re: [PHC] How to: A super-efficient cryptographic accumulator?

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: <20180313165824.GA26688@openwall.com>
Date: Tue, 13 Mar 2018 17:58:24 +0100
From: Solar Designer <solar@...nwall.com>
To: discussions@...sword-hashing.net
Subject: Re: [PHC] How to: A super-efficient cryptographic accumulator?

On Tue, Mar 13, 2018 at 11:30:52AM -0400, Ken T Takusagawa wrote:
> For rejecting previously revealed passwords, the hash-based 
> Bloom Filter data structure will do the trick.

FWIW, I also mentioned this in a thread on the passwords list:

http://www.openwall.com/lists/passwords/2017/10/29/2

and I think the passwords list is more appropriate for non-PHC and
non-password-hashing discussions like this, although I understand that
the PHC list reaches knowledgeable people who might not be on the
passwords list.

Alexander