phc-discussions - Re: [PHC] Asymmetric proof-of-work based on the Generalized Birthday problem

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] [day] [month] [year] [list]

Message-ID: <CAMtf1Hs7p8-k1v103aFyotywgNqWj2RoEkxEq91tQ_bbdf+Jxw@mail.gmail.com>
Date: Wed, 30 Sep 2015 08:36:45 +1000
From: Ben Harris <mail@...rr.is>
To: discussions@...sword-hashing.net
Subject: Re: [PHC] Asymmetric proof-of-work based on the Generalized Birthday problem

On 29 September 2015 at 19:28, Dmitry Khovratovich <khovratovich@...il.com>
wrote:

>
>  For example, the proof for 700-MB memory is 148 bytes long. The
> implementation exists but is not optimized.
>
>
> Did you consider compressing the xi's in the solution? A quick try with
Golomb/Rice Coding would save about 18 bytes in the n=144, k=5 case above
(only 12%). The compression is much better for larger k - ~40% reduction
for n=176, k=10. (I'm assuming that the xi's are randomly distributed, and
that I've read it correctly that they will be in natural order)

Content of type "text/html" skipped