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
| ||
|
Message-ID: <CA+hr98EUQn03u8nxiw9r61Haw5BfShUqfkA_DEiNHQ_844OK4A@mail.gmail.com> Date: Mon, 8 Sep 2014 17:22:24 +0200 From: Krisztián Pintér <pinterkr@...il.com> To: "discussions@...sword-hashing.net" <discussions@...sword-hashing.net> Subject: Re: [PHC] Generalised password hashing for arbitrary proof of work On Mon, Sep 8, 2014 at 6:00 AM, Ben Harris <ben@...rr.is> wrote: > I've been looking at Cuckoo Cycle > (https://github.com/tromp/cuckoo/blob/master/cuckoo.pdf?raw=true) as a proof can someone explain me how this does not leak information through total running time? (that is, not cache timing, but traffic analysis.)
Powered by blists - more mailing lists