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: <20180315192146.GA572@openwall.com>
Date: Thu, 15 Mar 2018 20:21:46 +0100
From: Solar Designer <solar@...nwall.com>
To: discussions@...sword-hashing.net
Subject: Re: [PHC] How to: A super-efficient cryptographic accumulator?

On Wed, Mar 14, 2018 at 06:24:33AM -0500, denis bider wrote:
> What I am looking for would be exactly like a Bloom filter in concept, but
> with:
> 
> - radically less memory use;
> 
> - computational cost could be increased by orders of magnitude to construct
> the filter;
> 
> - but the computational cost of using it should remain reasonable.
> 
> Is anyone aware of any work involving such tradeoffs?
> 
> And if not, where would be the right place to ask this question? Would the
> "passwords" list be any more likely to have this answer? :-)

I wouldn't expect the "passwords" list to be any more likely to have the
answer, but feel free to try asking in there as well, if you include
your explanation of the use case relevant to passwords and perhaps refer
to this thread for what's already been discussed.  You can refer to this
thread via:

http://lists.openwall.net/phc-discussions/2018/03/13/

(The thread is broken in a few places perhaps because some of the
messages were off-list, hence linking to the day rather than the thread.)

Alexander